when 15 is divided by the positive integer k, the remainder is 3, for how many diff

<p>when 15 is divided by the positive integer k, the remainder is 3, for how many diff....values of k is this true?</p>

<p>A: 1
B: 2
C: 3
D: 4
E: 5</p>

<p>plz EXPLAIN...thanks</p>

<p>C. The only way there's a remainder of 3 is if 12 is a multiple of k and k is greater than 3. So it could be 4, 6, or 12.</p>

<p>You could also just do the remainder for 15 divided by every integer up to 15.</p>

<p>idk if my explanation is that great, tell me if you need it explained better.</p>

<p>WOAH THANKS! that makes sense, i never thought about it that way : there's a remainder of 3 is if 12 is a multiple of k... ^^</p>