Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory intermediate

Problem

Given that is a multiple of , find the greatest common divisor of and .
Solution
We can use the Euclidean Algorithm. Since is a factor of and thus , the greatest common divisor is .
Final answer
4