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) = 3?  Choices.
A) 14  B) 9  C) 16  D) 23  E) 24
16 = ky+3   since -- &gt; 0 &lt;=remainder &lt; divisor   therefore y&gt;1   ky=13 =&gt; y =13/k :- possible values of k for y to be +int y=1,13   hence, sum = 14
<result>A</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) = 3?