We know:ddm wrote: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?
8
9
16
23
24
-the remainder is 1 when 16 is divided by y;
-in other words, 16 is 1 larger than a multiple of y.
Well, 16 is one larger than 15, so 15 must be a multiple of y. Since y can't be 1 (the remainder would be zero), y could be 15, 5, or 3.
15+5+3 = 23.
