My answer is D. 16i hope i will be a help:)GoMBA wrote:Can someone help with a technique to solve this and similar type questions....
Find the greatest number, which will divide 215,167 and 135 so as to leave the same remainder in each case?
a. 64
b. 32
c. 24
d. 16
e. 8
the technique is to understand the question .. the "greatest number " u need to find the GCD of mod ( c-a),mod ( a-b), mod ( b-c) thats it ..
hence the numbers are 80, 32,48.
GCD of them is 16. thats it ...
If he asks u the least number .. then do an LCM...
do let me know if u have any doubts,,,

















