Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

What is the greatest common divisor of positive integers m and n?

(1) m is a prime number --> if \(m=2=prime\) and \(n=1\) then \(GCD(m,n)=1\) but if \(m=2=prime\) and \(n=4\) then \(GCD(m,n)=2\). Two different answers, hence not sufficient.

(2) 2n=7m --> \(\frac{m}{n}=\frac{2}{7}\) --> \(m\) is a multiple of 2 and \(n\) is a multiple of 7, but this is still not sufficient: if \(m=2\) and \(n=7\) then \(GCD(m,n)=1\) (as both are primes) but if \(m=4\) and \(n=14\) then \(GCD(m,n)=2\) (basically as \(\frac{m}{n}=\frac{2x}{7x}\) then as 2 and 7 are primes then \(GCD(m, n)=x\)). Two different answers, hence not sufficient.

(1)+(2) Since from (1) \(m=prime\) and from (2) \(\frac{m}{n}=\frac{2}{7}\) then \(m=2=prime\) and \(n=7\), hence \(GCD(m,n)=1\). Sufficient.

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

04 Oct 2016, 09:58

1

This post received KUDOS

puchku wrote:

abhimahna wrote:

puchku wrote:

I marked B for this question.

My reasoning is - 2n = 7m Since 2 and 7 don't have any common factors other than 1, 'm' must be a multiple of 2 and 'n' a multiple of 7. So GCD(m,n) = m/2 = n/7

My doubt is, in such questions are we not allowed to deduce an answer in terms of variables 'm' and 'n'?

Try taking the values of m = 2,4,6 and as we know n = 7m/2, we can have n = 7,14,21, and so on.

When combined with Statement 1, we can say m could be only 2. Thus n could be only 7. Hence, HCF= 1.

But even without considering Statement 1, on the basis of Statement 2 we can say that GCM(m.n) will be m/2

For example m=2 => n=7 => GCD(2,7) = m/2 = 1 m=4 => n=14 => GCD(4,14) = m/2 = 2

Now, even though the actual values are different here, can't we assume that we know the values of 'm' and 'n' (since we want to find their GCD), and thus, in turn, we know the value of GCD which is m/2

But since this is an official question and the answer is C, I am guessing that in DS questions, we have to be able to determine exact values and not such relations

Highlighted line above is the rule for DS questions. We should have a definite answer to arrive at any conclusion.
_________________

1) no info about n (insuf) 2) n=7m/2. To make n an integer, m=2b (b is an pos integer). With b=1,2,3...we have varied GCD of m and n (insuf) Together we have m=2, n=7 GCD=1, suf

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

24 Sep 2012, 22:02

1) This statement says that M is Prime no, So N can be Prime/Composite. If N is Prime , clearly GCD will be 1, If N is composite also GCD will be 1( Except when M itself is a divisor of N, means N<>kM(not equals)), If N=kM then GCD(M,N) will be M it self.(where k is an integer)

2)2N=7M, its clearly not sufficient.

Combining:

From the statement 1, if we can get N=kM or not(where k is an integer) then we will be sure whats the GCD. As from the statement 2, we can see that N=7/2 M, and 7/2 is not an integer. So clearly GCD will be 1.

Re: What is the greatest common divisor of the positive integers [#permalink]

Show Tags

24 Sep 2013, 11:07

Bunuel wrote:

What is the greatest common divisor of positive integers m and n?

(1) m is a prime number --> if \(m=2=prime\) and \(n=1\) then \(GCD(m,n)=1\) but if \(m=2=prime\) and \(n=4\) then \(GCD(m,n)=2\). Two different answers, hence not sufficient.

(2) 2n=7m --> \(\frac{m}{n}=\frac{2}{7}\) --> \(m\) is a multiple of 2 and \(n\) is a multiple of 7, but this is still not sufficient: if \(m=2\) and \(n=7\) then \(GCD(m,n)=1\) (as both are primes) but if \(m=4\) and \(n=14\) then \(GCD(m,n)=2\) (basically as \(\frac{m}{n}=\frac{2x}{7x}\) then as 2 and 7 are primes then \(GCD(m, n)=x\)). Two different answers, hence not sufficient.

(1)+(2) Since from (1) \(m=prime\) and from (2) \(\frac{m}{n}=\frac{2}{7}\) then \(m=2=prime\) and \(n=7\), hence \(GCD(m,n)=1\). Sufficient.

Answer: C.

Greatest Common divisor and Highest common factor are same thing Bunuel?

Because n= 7m/2 (Taking both this is true only for m = 2) So Greatest common divisor is 2 not 1, Isn't it?
_________________

Like my post Send me a Kudos It is a Good manner. My Debrief: http://gmatclub.com/forum/how-to-score-750-and-750-i-moved-from-710-to-189016.html

What is the greatest common divisor of positive integers m and n?

(1) m is a prime number --> if \(m=2=prime\) and \(n=1\) then \(GCD(m,n)=1\) but if \(m=2=prime\) and \(n=4\) then \(GCD(m,n)=2\). Two different answers, hence not sufficient.

(2) 2n=7m --> \(\frac{m}{n}=\frac{2}{7}\) --> \(m\) is a multiple of 2 and \(n\) is a multiple of 7, but this is still not sufficient: if \(m=2\) and \(n=7\) then \(GCD(m,n)=1\) (as both are primes) but if \(m=4\) and \(n=14\) then \(GCD(m,n)=2\) (basically as \(\frac{m}{n}=\frac{2x}{7x}\) then as 2 and 7 are primes then \(GCD(m, n)=x\)). Two different answers, hence not sufficient.

(1)+(2) Since from (1) \(m=prime\) and from (2) \(\frac{m}{n}=\frac{2}{7}\) then \(m=2=prime\) and \(n=7\), hence \(GCD(m,n)=1\). Sufficient.

Answer: C.

Greatest Common divisor and Highest common factor are same thing Bunuel?

Because n= 7m/2 (Taking both this is true only for m = 2) So Greatest common divisor is 2 not 1, Isn't it?

Yes, GCD and GCF are the same thing.

But couldn't understand your second point: the greatest common divisor of 2 and 7 is 1. How can it be 2? Is 7 divisible by 2?
_________________

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

16 Nov 2014, 07:14

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

27 Nov 2015, 01:46

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

03 Oct 2016, 09:19

I marked B for this question.

My reasoning is - 2n = 7m Since 2 and 7 don't have any common factors other than 1, 'm' must be a multiple of 2 and 'n' a multiple of 7. So GCD(m,n) = m/2 = n/7

My doubt is, in such questions are we not allowed to deduce an answer in terms of variables 'm' and 'n'?

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

03 Oct 2016, 09:52

puchku wrote:

I marked B for this question.

My reasoning is - 2n = 7m Since 2 and 7 don't have any common factors other than 1, 'm' must be a multiple of 2 and 'n' a multiple of 7. So GCD(m,n) = m/2 = n/7

My doubt is, in such questions are we not allowed to deduce an answer in terms of variables 'm' and 'n'?

Try taking the values of m = 2,4,6 and as we know n = 7m/2, we can have n = 7,14,21, and so on.

When combined with Statement 1, we can say m could be only 2. Thus n could be only 7. Hence, HCF= 1.
_________________

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

03 Oct 2016, 12:14

abhimahna wrote:

puchku wrote:

I marked B for this question.

My reasoning is - 2n = 7m Since 2 and 7 don't have any common factors other than 1, 'm' must be a multiple of 2 and 'n' a multiple of 7. So GCD(m,n) = m/2 = n/7

My doubt is, in such questions are we not allowed to deduce an answer in terms of variables 'm' and 'n'?

Try taking the values of m = 2,4,6 and as we know n = 7m/2, we can have n = 7,14,21, and so on.

When combined with Statement 1, we can say m could be only 2. Thus n could be only 7. Hence, HCF= 1.

But even without considering Statement 1, on the basis of Statement 2 we can say that GCM(m.n) will be m/2

For example m=2 => n=7 => GCD(2,7) = m/2 = 1 m=4 => n=14 => GCD(4,14) = m/2 = 2

Now, even though the actual values are different here, can't we assume that we know the values of 'm' and 'n' (since we want to find their GCD), and thus, in turn, we know the value of GCD which is m/2

But since this is an official question and the answer is C, I am guessing that in DS questions, we have to be able to determine exact values and not such relations

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

04 Oct 2016, 08:54

puchku wrote:

abhimahna wrote:

puchku wrote:

I marked B for this question.

My reasoning is - 2n = 7m Since 2 and 7 don't have any common factors other than 1, 'm' must be a multiple of 2 and 'n' a multiple of 7. So GCD(m,n) = m/2 = n/7

My doubt is, in such questions are we not allowed to deduce an answer in terms of variables 'm' and 'n'?

Try taking the values of m = 2,4,6 and as we know n = 7m/2, we can have n = 7,14,21, and so on.

When combined with Statement 1, we can say m could be only 2. Thus n could be only 7. Hence, HCF= 1.

But even without considering Statement 1, on the basis of Statement 2 we can say that GCM(m.n) will be m/2

For example m=2 => n=7 => GCD(2,7) = m/2 = 1 m=4 => n=14 => GCD(4,14) = m/2 = 2

Now, even though the actual values are different here, can't we assume that we know the values of 'm' and 'n' (since we want to find their GCD), and thus, in turn, we know the value of GCD which is m/2

But since this is an official question and the answer is C, I am guessing that in DS questions, we have to be able to determine exact values and not such relations

Can some expert please shed light on my interpretation?

Re: What is the greatest common divisor of positive integers m [#permalink]

Show Tags

26 Jan 2017, 12:07

(1) No info about n but we could test below values as well that will make this statement insufficient.

if m = 3 (which is prime) and n = 6, then the gcf is 3. if m = 3 (which is prime) and n = 5, then the gcf is 1. insufficient.

(2)In the case of this statement, you can divide by 2m on both sides, to give n/m = 7/2. (you could also divide by 7n, to give m/n = 2/7.)

so, the ratio of n to m is 7:2. if they're actually 7 and 2, the gcf is 1. if they're multiples of these numbers, then the gcf is not 1. (for instance, if they're 14 and 4, the gcf is 2.) insufficient.

--

(together) if you need a prime, and the ratio is 7 to 2, then the numbers must actually be 7 and 2. sufficient.
_________________

Thanks & Regards, Anaira Mitch

gmatclubot

Re: What is the greatest common divisor of positive integers m
[#permalink]
26 Jan 2017, 12:07

Best Schools for Young MBA Applicants Deciding when to start applying to business school can be a challenge. Salary increases dramatically after an MBA, but schools tend to prefer...

Marty Cagan is founding partner of the Silicon Valley Product Group, a consulting firm that helps companies with their product strategy. Prior to that he held product roles at...