Browse · MathNet
PrintAPMO
number theory
Problem
Determine all finite nonempty sets of positive integers satisfying where is the greatest common divisor of and .
Solution
Let . Then is in as well.
Suppose for the sake of contradiction that there is an odd number in , and let be the largest such odd number. Since , is in as well, a contradiction. Hence has no odd numbers.
Now suppose that is the second smallest number in . Then is even and is in . Since , , a contradiction again.
Therefore can only contain , and is the only solution.
Suppose for the sake of contradiction that there is an odd number in , and let be the largest such odd number. Since , is in as well, a contradiction. Hence has no odd numbers.
Now suppose that is the second smallest number in . Then is even and is in . Since , , a contradiction again.
Therefore can only contain , and is the only solution.
Final answer
{2}
Techniques
Greatest common divisors (gcd)IntegersInvariants / monovariants