Browse · MathNet
PrintSelection tests for the Gulf Mathematical Olympiad 2013
Saudi Arabia 2013 number theory
Problem
Find all pairs of positive integers such that divides both and .
Solution
We have Let be a common divisor of and . Then divides and , so it divides . Hence and are coprime. In a similar way and are coprime. Thus .
If then , since , which is a contradiction. Hence , since and are coprime.
If then , since , which is a contradiction. Hence , since and are coprime.
Final answer
(1,1)
Techniques
Greatest common divisors (gcd)Factorization techniques