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?
Choose the correct choice from the following options
A) 8  B) 9  C) 16  D) 23  E) 24
(x # y) represents the remainder that results when the positive integer x is divided by the positive integer y.   Thus (16 # y) = 1 implies that 16=yq+1 --&gt; 15=yq--&gt; y is a factor of 15. The factors of 15 are 1, 3, 5, and 15. Now, y cannot be 1, since 16 divided by 1 yields the remainder of 0 not 1.   Therefore the sum of all the possible values of y is   3+5+15= 
<gadget id="calculator">  3+5+15</gadget>
<output>23</output>
23.   Answer: 23.
<result>D</result>
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?