kannans3 wrote:
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+n is a multiple of 35?
(A) 3
(B) 4
(C) 12
(D) 32
(E) 35
When positive integer n is divided by 5, the remainder is 1.
The smallest possible value of n that satisfies the statement above is the given remainder of 1.
To determine the other possible values of n, just keep adding multiples of the divisor 5:
1,6,11,16,21,26,31...
When positive integer n is divided by 7, the remainder is 3.
The smallest possible value of n that satisfies the statement above is the given remainder of 3.
To determine the other possible values of n, just keep adding multiples of the divisor 7:
3,10,17,24,31...
The smallest value included in both lists is n=31.
Now we can plug in the answers, which represent the smallest possible value of k.
When the correct answer is added to n=31, the sum will be a multiple of 35.
Since we need the smallest possible value of k, we should start with the smallest answer choice.
Answer choice A: k=3
n+k = 31+3 = 34. Not a multiple of 35.
Eliminate A.
Answer choice B: k=4
n+k = 31+4 = 35. Success!
The correct answer is
B.
Another problem about remainders:
https://www.beatthegmat.com/remainder-t115616.htmlPrivate tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at
[email protected].
Student Review #1
Student Review #2
Student Review #3
