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 Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions
Start free 5-day trial
Read 559 reviewsTarget Test Prep

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
Post new topic Post Reply
Previous Topic Next Topic
Senior | Next Rank: 100 Posts
Posts: 40
Joined: Tue Jun 24, 2008 8:36 am
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
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Legendary Member
Posts: 829
Joined: Mon Jul 07, 2008 10:09 pmFollowed by: 3 members
Location: INDIA
Thanked: 84 times

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,,,
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 40
Joined: Tue Jun 24, 2008 8:36 am

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,,,
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 829
Joined: Mon Jul 07, 2008 10:09 pmFollowed by: 3 members
Location: INDIA
Thanked: 84 times

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...
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 891
Joined: Sat Aug 16, 2008 4:21 amFollowed by: 1 member
Thanked: 27 times
GMAT Score:660(

by 4meonly » Thu Aug 21, 2008 7:13 am
why we should find GCD of the difference?
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 2623
Joined: Mon Jun 02, 2008 3:17 amFollowed by: 355 members
Location: Montreal
Thanked: 1090 times
GMAT Score:780

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
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1