Skip to main content
OlympiadHQ

Browse · MathNet

Print

60th Belarusian Mathematical Olympiad

Belarus number theory

Problem

Find all pairs of positive integers and such that where is the greatest common divisor of and .
Solution
By condition it follows that one of the numbers is divisible by . Moreover, exactly one of the numbers is divisible by , otherwise and are divisible by , and so is divisible by , a contradiction. Let without loss of generality , . Then , , and the equation can be rewritten as . Since and are divisible by , it follows that is a factor of , i.e. .

If , then is divisible by , so , and, therefore, . Thus , i.e. . Therefore, . If either or , then , but or , which are impossible. Hence , i.e. is equal to either or .

1) Let . Then , and at least one of the numbers is odd. Since , we find that either and or and . This gives the solutions of the initial equation: and .

2) Now let . Then . Set , , where and are coprime. Then . Hence either and or and . This gives the solutions of the initial equation: and .

Since the initial equation is symmetric with respect to and , we have four more solutions: , , , .
Final answer
(125, 2), (2, 125), (250, 1), (1, 250), (10, 34), (34, 10), (170, 2), (2, 170)

Techniques

Greatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalities