GCD
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
- rahulg83
- Legendary Member
- Posts: 575
- Joined: Tue Nov 04, 2008 2:58 am
- Location: India
- Thanked: 18 times
- Followed by:4 members
- GMAT Score:710
Yes C is the right choice.
Consider m = 13*k (k any integer)
n = 7*k (k any integer), note that 13 and 7 are prime.
Only way for the GCD to be equal to 3 is that m=13*3 and n=7*3
therefore m*n can be found using both statements but not by either 1st or 2nd
Consider m = 13*k (k any integer)
n = 7*k (k any integer), note that 13 and 7 are prime.
Only way for the GCD to be equal to 3 is that m=13*3 and n=7*3
therefore m*n can be found using both statements but not by either 1st or 2nd












