If (x # y) represents the remainder that results when the positive integer x is divided by the positive integer y, what is the sum of all the possible values of y such that (16 # y) = 1?
a. 8
b. 9
c. 16
d. 23
e. 24
For this question, I made a careless mistake that seems to be easy to make if I use this strategy to solve. Below is my strategy, please let me know if there is a better way to do it or if I did something wrong.
16/y = Q + 1/y
16 = Qy + 1
Qy = 15
so Y could equal 3, 5, 15 and 1.
adds to 24.
OA is 23 because if you divide 16 by 1, you don't get a remainder. But in trying to figure out how to answer the question using the way i show above, it seems easy to get lost and accidentally add that 1 in there... does someone have a better way to do it?
a. 8
b. 9
c. 16
d. 23
e. 24
For this question, I made a careless mistake that seems to be easy to make if I use this strategy to solve. Below is my strategy, please let me know if there is a better way to do it or if I did something wrong.
16/y = Q + 1/y
16 = Qy + 1
Qy = 15
so Y could equal 3, 5, 15 and 1.
adds to 24.
OA is 23 because if you divide 16 by 1, you don't get a remainder. But in trying to figure out how to answer the question using the way i show above, it seems easy to get lost and accidentally add that 1 in there... does someone have a better way to do it?
