Browse · MATH
Printjmc
number theory senior
Problem
Given that is a multiple of , find the greatest common divisor of and .
Solution
We use the Euclidean Algorithm. Since is a divisor of , and is a multiple of , the greatest common divisor is .
Final answer
57