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

Greatest common divisor

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Legendary Member
Posts: 1161
Joined: Mon May 12, 2008 2:52 amFollowed by: 1 member
Location: Sydney
Thanked: 23 times
by mehravikas » Fri Jun 20, 2008 2:01 am
S13-25 What is the greatest common divisor of positive integers m and n ?

(1) m is a prime number.
(2) m and n are consecutive integers.
Last edited by mehravikas on Fri Jun 20, 2008 5:13 am, edited 1 time in total.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Data Sufficiency |
Master | Next Rank: 500 Posts
Posts: 100
Joined: Fri Jul 27, 2007 12:36 pm
Thanked: 6 times

by g_beatthegmat » Fri Jun 20, 2008 3:29 am
Answer should be (B).

(A) is insufficient as it doesn't tell us about 'n'. m could be a prime number, but n could be a multiple of m.

(B) is sufficient as it tells us that m and n are consecutive numbers. In such a case, the numbers cannot not have any common factors, thus GCF is 1.
Eg: 2, 3.
10, 11.
48, 49
etc.

Hope it helps.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 1161
Joined: Mon May 12, 2008 2:52 amFollowed by: 1 member
Location: Sydney
Thanked: 23 times

by mehravikas » Fri Jun 20, 2008 5:14 am
Thanks, it does help. OA is 'B'
g_beatthegmat wrote:Answer should be (B).

(A) is insufficient as it doesn't tell us about 'n'. m could be a prime number, but n could be a multiple of m.

(B) is sufficient as it tells us that m and n are consecutive numbers. In such a case, the numbers cannot not have any common factors, thus GCF is 1.
Eg: 2, 3.
10, 11.
48, 49
etc.

Hope it helps.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Newbie | Next Rank: 10 Posts
Posts: 3
Joined: Sat Apr 25, 2009 8:21 am

by helviolc » Sun Jul 26, 2009 2:43 am
(I) alone is insufficient because the GCD can be m only if n is a multiple of m - all other cases will lead to no commom divider. This leads to two possible answers so therefore Insufficient.

(2) alone is insufficient because you can have more than one number combination that satisfies the equation but gives you a different GCD: To test, plug m=2 , n=7 (no commom divider) or m=6 , n=21 (3 as a commom divider)

(1) and (2) together satisfy the question. The only prime number for m that satisfies equation (2) is 2, stating that the numbers do not have a commom divider, as n will be equal to 7, another prime number.

So, answer is C.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 1161
Joined: Mon May 12, 2008 2:52 amFollowed by: 1 member
Location: Sydney
Thanked: 23 times

by mehravikas » Sun Jul 26, 2009 1:18 pm
Sorry but the answer is B

As per statement 2, m and n are consecutive integers.
helviolc wrote:(I) alone is insufficient because the GCD can be m only if n is a multiple of m - all other cases will lead to no commom divider. This leads to two possible answers so therefore Insufficient.

(2) alone is insufficient because you can have more than one number combination that satisfies the equation but gives you a different GCD: To test, plug m=2 , n=7 (no commom divider) or m=6 , n=21 (3 as a commom divider)

(1) and (2) together satisfy the question. The only prime number for m that satisfies equation (2) is 2, stating that the numbers do not have a commom divider, as n will be equal to 7, another prime number.

So, answer is C.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1