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
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
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
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
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.

715+ 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.

What is the greatest common divisor ?

Expert replies
by goelmohit2002 » Sun Jul 26, 2009 9:32 am
Hi All,

Can someone please tell how to solve this question ?

If x and y are positive integers such that x = 8y +12. What is the greatest common divisor of x and y ?

1) x = 12u, where u is an integer.
2) y = 12z, where z is an integer.

OA = B.

Thanks
Mohit
Join the discussion
Source: — Data Sufficiency |

by yogami » Sun Jul 26, 2009 12:37 pm
From (1) if we substitute values we get
since x = 12u, y = 3(u - 1)/2
This means that 2 can be a factor of u - 1 only when u is an odd integer but that is not guaranteed hence this is insuff

From (2) y = 12z implies x = 12(8*z + 1) and you can clearly see 12 as a common factor
So suff
200 or 800. It don't matter no more.
Join the discussion

by goelmohit2002 » Sun Jul 26, 2009 1:08 pm
yogami wrote: From (2) y = 12z implies x = 12(8*z + 1) and you can clearly see 12 as a common factor
So suff
Thanks yogami.

But 12 is a common factor...but the question is asking about greatest common factor...

why 12 is the greatest ? Why not 24, 36, 48, 60....

How to prove that 12 or any of the above numbers is the greatest common factor....
Join the discussion

by goelmohit2002 » Mon Jul 27, 2009 8:54 am
Can someone please help to solve this question ?
Join the discussion

by ogbeni » Mon Jul 27, 2009 10:16 am
@goelmohit2002

I'm with you. How do you know for certain that 12 is the GCD/GCF

I know from my Manhattan GMAT Number Properties Guide that the GCF of X and Y cannot be greater than X-Y.

Consider X(96Z+12) - Y(12Z) = 84Z+12. So the GCF/GCD of X and Y cannot be greater than 84Z+12 but we don't know what Z is and it could be 24, 48, 36......
Join the discussion

by goelmohit2002 » Mon Jul 27, 2009 10:32 am
ogbeni wrote: I know from my Manhattan GMAT Number Properties Guide that the GCF of X and Y cannot be greater than X-Y.
Thanks ogbeni.

The above is something new to me....I was of the opinion that gcd/gcf of X and Y is less than or equal to the lower of (X,Y).....

e.g. 2,6....the gcf is 2....

Can you please give one example where gcf is greater then lower of two numbers ? for e.g. above X -Y comes to be 4.....
Join the discussion

by Ian Stewart » Mon Jul 27, 2009 11:53 am
The GCD of two numbers can't be larger than either of the numbers, of course, since no number is divisible by something which is larger than itself. For example, the GCD of 100 and something else could never be greater than 100, since 100 isn't divisible by anything greater than 100.

The one fact missing from the explanations above is this: the GCD of x and 8x + 1 must be 1. A quick explanation: if d is greater than 1, and d is a divisor of x, then d is a divisor of 8x. So the remainder will be 1 when 8x+1 is divided by d, since 8x+1 is 1 greater than an exact multiple of d; that is, 8x+1 cannot be divisible by d. So x and 8x+1 can't share a divisor besides 1.
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

by goelmohit2002 » Mon Jul 27, 2009 12:16 pm
Ian Stewart wrote:The GCD of two numbers can't be larger than either of the numbers, of course, since no number is divisible by something which is larger than itself. For example, the GCD of 100 and something else could never be greater than 100, since 100 isn't divisible by anything greater than 100.

The one fact missing from the explanations above is this: the GCD of x and 8x + 1 must be 1. A quick explanation: if d is greater than 1, and d is a divisor of x, then d is a divisor of 8x. So the remainder will be 1 when 8x+1 is divided by d, since 8x+1 is 1 greater than an exact multiple of d; that is, 8x+1 cannot be divisible by d. So x and 8x+1 can't share a divisor besides 1.
Awesome Ian !!!

Thanks a lot....

Just posted a similar reply using this concept.....on one of the threads in which you too participated....

Can you please look into the same at the below link...and tell if there is any flaw in my reasoning....

https://www.beatthegmat.com/gmat-prep-q- ... tml#174337
Join the discussion