Bunuel
When m is divided by 9, the remainder is 2. When m is divided by 13, the remainder is 8. If 1 < m < 200, what is the greatest possible value of m?
A. 47
B. 65
C. 103
D. 117
E. 164
When m is divided by 9, the remainder is 2 --> \(m=9q+2\) --> m can be 2, 11, 20, 29, 38,
47, ...
When m is divided by 13, the remainder is 8 --> \(m=13p+8\) --> m can be 8, 21, 34,
47, 60, 73, ...
There is a way to derive general formula for m (of a type \(m=dx+r\), where d is divisor and r is a remainder) based on above two statements:Divisor d would be the least common multiple of above two divisors 9 and 13, hence \(d=117\) and the remainder r would be the first common integer in above two patterns, hence \(r=47\).
Therefore general formula based on both statements is \(m=117x+47\) --> n can be 47, 164, 211, ... Since m must be less than 200, then the greatest possible value of m is 164.
Answer: E.
More about deriving general formula for such problems at:
https://gmatclub.com/forum/manhattan-rem ... ml#p721341Hope it helps.