BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

leaves the same remainder

Expert replies
by GoMBA » Tue Aug 19, 2008 8:23 am
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
Join the discussion
Source: — Problem Solving |

Re: leaves the same remainder

by sudhir3127 » Tue Aug 19, 2008 8:37 am
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
My answer is D. 16i hope i will be a help:)

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,,,
Join the discussion

Re: leaves the same remainder

by GoMBA » Tue Aug 19, 2008 8:44 am
Taking the GCD because its asking for the greatest number is something i was also able to guess. But how did you arrive at taking the GCD for (c-a), (a-b), (b-c)? And also i didnt understand what do you mean by mod(c-a)?

Thanks.


sudhir3127 wrote:
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
My answer is D. 16i hope i will be a help:)

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,,,
Join the discussion

Re: leaves the same remainder

by sudhir3127 » Tue Aug 19, 2008 8:49 am
GoMBA wrote:Taking the GCD because its asking for the greatest number is something i was also able to guess. But how did you arrive at taking the GCD for (c-a), (a-b), (b-c)? And also i didnt understand what do you mean by mod(c-a)?

Thanks.



sudhir3127 wrote:
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
My answer is D. 16i hope i will be a help:)

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,,,

I am sorrie abt that.. Mod mean Absolute.. thats the formula...
Join the discussion

by 4meonly » Thu Aug 21, 2008 7:13 am
why we should find GCD of the difference?
Join the discussion

by Ian Stewart » Thu Aug 21, 2008 8:10 am
If we write out what the question is saying, where d is the divisor, and r the remainder, we have:

1. 215 = ad + r
2. 167 = bd + r
3. 135 = cd + r

If you subtract these in pairs (subtract 2. from 1., 3. from 2., and 3. from 1.) we have:

48 = (a-b)d
32 = (b-c)d
80 = (a-c)d

That is, 48, 32 and 80 are all multiples of d. The largest possible value of d is the GCD of 48, 32 and 80, which is 16.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com
Join the discussion