-
Jayanth2689
- Senior | Next Rank: 100 Posts
- Posts: 69
- Joined: Sat Jul 31, 2010 9:27 pm
- Thanked: 2 times
- Followed by:4 members
- GMAT Score:640
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?
(1) a = 2b + 6
(2) a = 3b
OA is A
Official Explanation for this -
[spoiler]MGMAT says that for a and b to always have 6 as the GCF, they have to be mutually prime.
Hence, Statement 1 is sufficient to answer. This can be tested by plugging in numbers also.
My question is, is it right for to assume that any question which asks to check if a number is the GCF of two numbers can be solved using the mutually prime property?
Or is this dependent on the statements given? in this case statement A. Also, please do share other useful divisibility and primes properties that can be applied for DS questions.[/spoiler]
(1) a = 2b + 6
(2) a = 3b
OA is A
Official Explanation for this -
[spoiler]MGMAT says that for a and b to always have 6 as the GCF, they have to be mutually prime.
Hence, Statement 1 is sufficient to answer. This can be tested by plugging in numbers also.
My question is, is it right for to assume that any question which asks to check if a number is the GCF of two numbers can be solved using the mutually prime property?
Or is this dependent on the statements given? in this case statement A. Also, please do share other useful divisibility and primes properties that can be applied for DS questions.[/spoiler]












