|
Author |
Message |
|
TAGS:
|
|
|
Manager
Joined: 02 Oct 2010
Posts: 163
Followers: 2
Kudos [?]:
1
[0], given: 29
|
What is the greatest common divisor of positive integers m [#permalink]
 19 Dec 2010, 23:27
Question Stats:
50% (01:49) correct
50% (00:52) wrong based on 74 sessions
What is the greatest common divisor of positive integers m and n ? (1) m is a prime number (2) 2n = 7m
Last edited by Bunuel on 02 Mar 2012, 12:22, edited 1 time in total.
Edited the question
|
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 12096
Followers: 1876
Kudos [?]:
10096
[0], given: 959
|
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.
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders
COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!! ,11 Mixed Questions NEW!!!, 12 Fresh Meat NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!, 11 New DS set. NEW!!!
What are GMAT Club Tests?
25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Manager
Joined: 29 Oct 2009
Posts: 58
Schools: Cambridge
Followers: 1
Kudos [?]:
7
[0], given: 14
|
From stmt 1 - since M is a prime number, and we do not have any info about n, we cannot say anything, hence insuff. From stmt 2 - 2n = 7m. This statement does not say anything about m and n. It only says that m/n = 2/7 . The number could be anything {2,7} or {6, 21} . Both the cases produce different highest common divisor. So insuff. Taking both the stmts together - what we know/deduce is - Divisors of product of two prime will be 1, the prime number1, the prime number 2, and the product of two prime num. so for 7m = {1, 7, m , 7m} and for 2n = 7m, given m to be a prime number, m has to be 2. If m is 2, then n = 7 and hence suff. Hope it clears.
_________________
No Execuse..
|
|
|
|
|
|
Intern
Joined: 03 Dec 2012
Posts: 5
Followers: 0
Kudos [?]:
0
[0], given: 4
|
Which is the greatest common divisor the two positive [#permalink]
27 Jan 2013, 03:18
Hi everybody!
I have some difficulties with this question.
Which is the greatest common divisor the two positive integers m and n?
1) m is a prime
2) 2n=7m
Thanks!
Last edited by MacFauz on 27 Jan 2013, 05:02, edited 1 time in total.
Edited title and added OA.
|
|
|
|
|
|
Director
Joined: 02 Jul 2012
Posts: 790
Location: India
Concentration: Strategy
GMAT 1: 740 Q49 V42
GPA: 3.8
WE: Engineering (Energy and Utilities)
Followers: 19
Kudos [?]:
277
[0], given: 45
|
Re: Which is the greatest common divisor the two positive [#permalink]
27 Jan 2013, 05:09
mjg2110 wrote: Hi everybody!
I have some difficulties with this question.
Which is the greatest common divisor the two positive integers m and n?
1) m is a prime
2) 2n=7m
Thanks! 1) m can take several values and there is no information about n. Insufficient. eg : m = 2, n = 1, GCF = 1 m = 2, n = 2, GCF = 2 2) m and n can take several values. Insufficient. eg : m = 2, n = 7, GCF = 1 m = 4, n = 14, GCF = 2 1 & 2 together, m = \frac{2}{7}n. So, n can only be 7 because any other value of n will either give a fraction or a non prime value for m. Hence values of n & m are known. Sufficient.
_________________
Kudos Please... If my post helped.
Thanks To The Almighty - My GMAT Debrief
My Own CR Question 1|My Own CR Question 2|My Own DS Question 1|My Own DS Question 2|
My Own PS Question 1
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 12096
Followers: 1876
Kudos [?]:
10096
[0], given: 959
|
Re: Which is the greatest common divisor the two positive [#permalink]
27 Jan 2013, 05:43
|
|
|
|
|
|
Senior Manager
Joined: 10 Oct 2012
Posts: 329
Followers: 5
Kudos [?]:
126
[0], given: 24
|
Re: What is the greatest common divisor of positive integers m [#permalink]
31 Jan 2013, 02:31
We have n and m as positive integers. From F.S 1, we have m is a prime.Let us assume m=7. Thus, for n=14, we have gcd(m,n) as 7, for n=6 we have gcd(m,n) as 1. Thus this statement by itself is not sufficient. From F.S 2, we have 2n=7m. Thus, n = 7m/2. Now as n,m are integers, m=2k(k is an integer). Thus, we get n=7k, m=2k. As both 2 and 7 are prime, the gcd(m,n) here will be k, and this can have any value(1,2,3...);Thus not sufficient. Combining both the F.S, we know m is prime and m=2k. Thus k can not be anything except 1, else m won't be a prime anymore. Thus, k=1 and n=7,m=2. gcd(m,n) = gcd(2,7) = 1. C.
_________________
All that is equal and not --> inequalities-basics-154285.html
|
|
|
|
|
|
Intern
Joined: 24 Dec 2012
Posts: 6
Location: United States
Concentration: Finance, Entrepreneurship
GPA: 3
WE: Corporate Finance (Investment Banking)
Followers: 0
Kudos [?]:
5
[0], given: 2
|
Re: What is the greatest common divisor of positive integers m [#permalink]
15 Feb 2013, 18:44
jullysabat wrote: What is the greatest common divisor of positive integers m and n ?
(1) m is a prime number
(2) 2n = 7m What is the GCF of m & n? (1) Insufficient- it can be any set of #'s (2 & 6, 3 & 12) (2) Insufficient- you can plug in any #'s that make the equation equal (n=35 & m=10 - GCF is 5 or n=26 & m=8 - GCF is 2) You know m is prime so the only way to balance out the equation is to replace m as 2 (only even prime #) b/c whatever 2n produces it will be an even #. odd * odd = odd even * even = even even * odd = even
|
|
|
|
|
|
|
Re: What is the greatest common divisor of positive integers m
[#permalink]
15 Feb 2013, 18:44
|
|
|
|
|
|
|
|
|
|
|
close
