Browse · MATH
Printjmc
number theory senior
Problem
Given that is an odd multiple of , find the greatest common divisor of and .
Solution
We can use the Euclidean Algorithm. The closest multiple of that we can spot to is so we have Since is a multiple of 9, both and are multiples of , is also a multiple of so the greatest common divisor is .
Final answer
9