What is the gcd of (2^a) - 1 and (2^b) -1 1. gcd(a, b) = 3

Question

What is the gcd of (2^a) - 1 and (2^b) -1

1. gcd(a, b) = 3
2. lcm(a, b) = 9

Praetorian · Answer

no one tried to solve this? :roll:

anandnk · Answer

a) gcd(a,b) = 3 this is satisfied by (3,6) and (3,9)
gcd of (2^a) - 1 and (2^b) -1 is ether 7 or 1
Insufficient

b) lcm(a,b) = 9 this is satisfied by (1,9), (3,9)
gcd of (2^a) - 1 and (2^b) -1 is 1

So B is sufficient.

lastochka · Answer

Anandnk,
i'm having a brain freeze, what does lcm and gcd stand for and how is it used in this example? 
merci!

anandnk · Answer

lcm - least common multiple

take two numbers 12 and 3 what is smallest number that is divisible by both these numbers? I guess 12

gcd - greatest common divisor

take two numbers 12 and 3 what is the biggest number that can divide both of these ? I guess 3

Makky07 · Answer

Hmm anandnk, I don't think I agree with your answer. I think the answer should be C.

 

1) Insufficient. We only know that a and b have 3 in common. a could be greater than or less than b.

2) Also insufficient. 
If a = 3^2 and b= 3, LCM = 3^2, then the gcd of (2^9) - 1 and (2^3) - 1 is 7.

If a = 3^2 and b = 3^2, LCM = 3^2, then the gcd of (2^9) - 1 and 
(2^9) - 1 is 511. 

Together,
Either a = 3^2 and b = 3 OR a = 3 and b = 3^2. Regardless, the gcd(a,b) will be 7 so the answer should be C. Both statements are sufficient together.

anandnk · Answer

Yeah did a silly mistake. I though 511 was a prime number.

hallelujah1234 · Answer

BTW, the answer is A.


gcd(x^m - y^m, x^n - y^n) = x^k - y^k, where k = gcd(m, n)

What is the gcd of (2^a) - 1 and (2^b) -1 1. gcd(a, b) = 3

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards