Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory intermediate

Problem

What is the greatest common divisor of and ?
Solution
By the Euclidean Algorithm, We notice that as , but is odd and thus not divisible by . The answer is .
Final answer
3