It's good to realize that no two distinct prime numbers have a common divisor other than 1.
We are asked to find the greatest common divisor of m and n
(1) If m is a prime number, n may or may not be a multiple of m. If it is, then the GCD is m. Otherwise, it is 1.
NOT SUFF
(2) If 2n = 7m, we can say thay n and m are in a 7 to 2 ratio (i.e. n=7x and m=2x for some positive integer x. The GCD will be x, but we have no way of finding its value.
NOT SUFF
(T) M =2x is a prime number, so x=1 and thus the GCD is 1. SUFF
Alternatively, if 7m =2n , 7m is even and m (a prime number) must be 2. We can find the value for n and thus answer the question.
Common Divisor
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
- kevincanspain
- GMAT Instructor
- Posts: 613
- Joined: Thu Mar 22, 2007 6:17 am
- Location: madrid
- Thanked: 171 times
- Followed by:64 members
- GMAT Score:790
- VivianKerr
- GMAT Instructor
- Posts: 1035
- Joined: Fri Dec 17, 2010 11:13 am
- Location: Los Angeles, CA
- Thanked: 474 times
- Followed by:365 members
@madhan_dc It's embedded as an image from postimage.org. You might want to check your browser settings. 
Vivian Kerr
GMAT Rockstar, Tutor
https://www.GMATrockstar.com
https://www.yelp.com/biz/gmat-rockstar-los-angeles
Former Kaplan and Grockit instructor, freelance GMAT content creator, now offering affordable, effective, Skype-tutoring for the GMAT at $150/hr. Contact: [email protected]
Thank you for all the "thanks" and "follows"!
GMAT Rockstar, Tutor
https://www.GMATrockstar.com
https://www.yelp.com/biz/gmat-rockstar-los-angeles
Former Kaplan and Grockit instructor, freelance GMAT content creator, now offering affordable, effective, Skype-tutoring for the GMAT at $150/hr. Contact: [email protected]
Thank you for all the "thanks" and "follows"!













