when 15 is devided by the positive integer k, the remainder is 3. for how many different values of k is this true?
the answer is four, but I don't know how to solve it.
thanks in advance.
2006-11-24 02:37:29 · 7 answers · asked by Anonymous in Education & Reference ➔ Homework Help
k = 4
k = 6
k = 12
2006-11-24 02:49:04 · answer #1 · answered by Anonymous · 4⤊ 0⤋
The previous answers are correct, there are only 3 positive integers that give a remainder of 3 when divided into 15.
But, there are four integers that give a remainder of 0. They are 1,3,5, and 15.
In other words if you divide 15 by 1, the answer is 15 with nothing left over. If you divide 15 by 3, the answer is 5, with nothing left over. And so on.
2006-11-24 11:10:39 · answer #2 · answered by DadOnline 6 · 1⤊ 0⤋
Write this out by the division algorithm:
15 = ak + 3.
Subtract 3 from both sides:
ak = 12.
That means k must be a divisor of 12.
Testing all the possibilities, we find that
4, 6 and 12 are the only ones that work.
So there are 3 values that work, not 4.
2006-11-24 11:59:30 · answer #3 · answered by steiner1745 7 · 0⤊ 0⤋
I am getting the answer as three
See, when 15 is divided by 4, 6, 12 the remainders are 3.
I checked the numbers below 15. (trial and error)
2006-11-24 10:54:52 · answer #4 · answered by Naval Architect 5 · 2⤊ 0⤋
4, 6, 12
2006-11-24 10:48:22 · answer #5 · answered by alti 3 · 0⤊ 1⤋
The answers are 4.6 and 12
2006-11-24 10:49:29 · answer #6 · answered by alpha 7 · 0⤊ 0⤋
i believe the value of k is 4
2006-11-24 10:41:02 · answer #7 · answered by boggdy 2 · 0⤊ 2⤋