19th kmo #1
Source: KMO round 2, problem 1
February 3, 2006
algorithmnumber theorygreatest common divisorrelatively primeEuclidean algorithmnumber theory unsolved
Problem Statement
For two positive integers a and b, which are relatively prime, find all integer that can be the great common divisor of and .