"When positive integer n is divided by 5, the remainder is 1.
When n is divided by 7, the remainder is 3.
What is the smallest positive integer k such that k+1 is a multiple of 35?"
A. 3
B. 4
C. 12
D. 32
E. 35
Solution B
The explanation in the guide is not very clear to me and seems to not be the optimal way to get the answer.
What I did instinctively under time pressure was: n=5k+1 and n=7k+3.
5k+1=7k+3 and k=-1
Therefore, substituting, n=-4. Since 0 is a multiple of every number; for k=4, n+k=0, which is also the right answer.
I'm really curious. Is what I did a correct other way to get the rigth answer or is it completely wrong and it just happens to lead to the right answer?
When n is divided by 7, the remainder is 3.
What is the smallest positive integer k such that k+1 is a multiple of 35?"
A. 3
B. 4
C. 12
D. 32
E. 35
Solution B
The explanation in the guide is not very clear to me and seems to not be the optimal way to get the answer.
What I did instinctively under time pressure was: n=5k+1 and n=7k+3.
5k+1=7k+3 and k=-1
Therefore, substituting, n=-4. Since 0 is a multiple of every number; for k=4, n+k=0, which is also the right answer.
I'm really curious. Is what I did a correct other way to get the rigth answer or is it completely wrong and it just happens to lead to the right answer?












