Browse · MATH
Printjmc
number theory intermediate
Problem
If is a positive integer, then and are also positive integers. We define the function such that is the greatest common divisor of and . Find the maximum possible value of .
Solution
By the Euclidean algorithm, we have since the integer is divisible by for all integers , as the factorization shows. Thus is equal to 3 for all positive integers , so its maximum value is .
Final answer
3