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

greatest common divisor of positive integers m and n

Expert replies
Source: — Data Sufficiency |

by GMATGuruNY » Fri May 06, 2016 9:51 pm
What is the greatest common divisor of positive integers m and n?

1) m is a prime number
2) 2n = 7m
Statement 1 is clearly INSUFFICIENT.
When one of the statements is clearly insufficient, consider how it might affect the OTHER statement.
Since statement 1 is in terms of m, rephrase statement 2 in terms of m.

Statement 2: m = (2/7)n
The smallest possible value for n is 7.

Case 1: n=7, m = (2/7)(7) = 2.
The GCF of 2 and 7 is 1.

Case 2: n=14, m=(2/7)(14) = 4.
The GCF of 4 and 14 is 2.

Since the GCF can be different values, INSUFFICIENT.

Statements combined:
Cases 1 and 2 imply that m must be EVEN.
One more case to confirm:

Case 3: n=21, m = (2/7)(21) = 6.
Case 3 confirms that m must be even.

Since statement 1 indicates that m is prime, only Case 1 -- m=2, n=7 -- satisfies both statements.
In Case 1, the GCF m and n is 1.
SUFFICIENT.

The correct answer is C.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Join the discussion

by MartyMurray » Fri May 06, 2016 10:24 pm
jain2016 wrote:What is the greatest common divisor of positive integers m and n ?

1) m is a prime number

2) 2n = 7m
Statement 1: m is a prime number

Since m could be any prime number and n could be equal to m, there are many possible answers that satisfy Statement 1.

Insufficient.

Statement 2: 2n = 7m

Since n and m are integers, this statement implies that 7 is a factor of n and 2 is a factor of m, and that other than 7 and 2, the factors of n and m are the same.

In other words, n/m = 7/2, n:m = 7:2, and n = 7k and m = 2k.

For instance, n could be 7 x 5 x 11 and m could be 2 x 5 x 11, in which case their greatest common divisor would be 55.

Alternatively n could be 7 x 1 and m could be 2 x 1, in which case their greatest common divisor would be 1.

Insufficient.

Statements Combined:

There is only one number that is both prime and a multiple of 2. So m = 2 and n = 7, and the greatest common divisor of n and m is 1.

Sufficient.

The correct answer is C.
Marty Murray
Perfect Scoring Tutor With Over a Decade of Experience
MartyMurrayCoaching.com
Contact me at [email protected] for a free consultation.
Join the discussion

by Jeff@TargetTestPrep » Tue Dec 19, 2017 9:26 am
jain2016 wrote:What is the greatest common divisor of positive integers m and n ?

1) m is a prime number

2) 2n = 7m
We need to determine the greatest common divisor, or the greatest common factor (GCF), of integers m and n.

Statement One Alone:

m is a prime number.

Since we don't know anything about n, statement one is not sufficient to answer the question. We can eliminate answer choices A and D.

Statement Two Alone:

2n = 7m

We can manipulate the equation 2n = 7m:

n = 7m/2

n/m = 7/2

Even with the equation rewritten, we see that there are many options for m and n, and thus there are many different GCFs for m and n. For instance, if n = 7 and m = 2, then the GCF is 1. However, if n = 14 and m = 4, then the GCF is 2. Statement two alone is not sufficient to answer the question. We can eliminate answer choice B.

Statements One and Two Together:

Using statements one and two, we know that m is prime and that n/m = 7/2. Therefore, m must equal 2 and n must equal 7. When m is 2 and n is 7, the GCF is 1.

Answer: C

Jeffrey Miller
Head of GMAT Instruction
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews
Join the discussion

by Brent@GMATPrepNow » Fri Dec 22, 2017 10:52 am
jain2016 wrote:What is the greatest common divisor of positive integers m and n ?

1) m is a prime number

2) 2n = 7m
Target question: What is the GCD of m and n?

Statement 1: m is a prime number
If m is a prime number, it has exactly 2 divisors (1 and m), so this tells us that the GCD of m and n must be either 1 or m.
Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT.

Statement 2: 2n = 7m
If 2n = 7m then we can rearrange the equation to get n = (7/2)m

IMPORTANT: Notice that if m were to equal an ODD number, then n would not be an integer. For example, if m = 3, then n = 21/2 (n is not an integer). Similarly, if m = 11, then n = 77/2 (n is not an integer). So, in order for n to be an INTEGER, m must be EVEN.

If m must be EVEN, there are several possible values for m and n. Consider these two cases:
case a: m = 2 and n = 7, in which case the GCD = 1
case b: m = 4 and n = 14, in which case the GCD=2
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT.

Statements 1 & 2 combined
From statement 1, we know that m is prime, and from statement 2, we know that m is even.
Since 2 is the only even prime number, we can conclude that m must equal 2.
If m = 2, then n must equal 7, which means that the GCD must be 1.
Since we are able to answer the target question with certainty, statements 1 & 2 combined are sufficient, and the answer is C

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image
Join the discussion