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

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

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