AMC 12 Mock Exam 3 Problem 9
Problem 9 of 25
What is the greatest common divisor of and ?
Answer choices
Show solution
Solution
For , , so : the exponents follow the Euclidean algorithm. Since , the answer is .
Tagged: gcd of numbers of the form $2^m-1$