gmatbull
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
What is the fastest (perhaps, algebra?) means of solving the question besides
random plugging numbers under test condition?
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?Given: \(a=6x\) and \(b=6y\). Question: is \(GCD(a,b)=6\)? Now, If \(x\) and \(y\) share any common factor >1then \(GCD(a,b)\) will be more than 6 if not then \(GCD(a,b)\) will be 6.
(1) \(a=2b+6\) --> \(6x=2*6y+6\) --> \(x=2y+1\) --> \(x\) and \(y\) do not share any factor >1, as if they were we would be able to factor out if from \(2y+1\). Sufficient.
(2) \(a=3b\) --> clearly insufficient.
Answer: A.
There is also a general rule:
if \(a\) and \(b\) are multiples of \(k\) and are \(k\) units apart from each other then \(k\) is greatest common divisor of \(a\) and \(b\).For example if \(a\) and \(b\) are multiples of 7 and \(a=b+7\) then 7 is GCD of \(a\) and \(b\).
So if we apply this rule to (1) \(a=2b+6\) --> both \(a\) and \(2b\) are multiples of 6 and are 6 apart, so GCD of \(a\) and \(2b\) is 6, hence GCD of \(a\) and \(b\) is also 6. Sufficient.
Hope it helps.
It would be great if one could find more questions involving GCD/GCF as they seem to be little tricky more often than not.