Browse · MathNet
PrintJunior Macedonian Mathematical Olympiad
North Macedonia number theory
Problem
Solve the equation in the set of natural numbers.
Solution
We introduce the substitution and we get the equation . There exist natural numbers and such that and . Then the equation gets the form , i.e. . Since the right-hand side is divisible by and two of the summands on the left-hand side are divisible by , it follows that is divisible by . Therefore, there exists a natural number such that . By substituting in the equation, the equation gets the form , or . Hence we get . It is clear that , since if that was not the case we would get , which is impossible. Then we have .
By multiplying the equation by , we get . Since is a natural number, is also a natural number. Therefore, , i.e. If , then and hence or , which is impossible. If , then . If , then . It follows that , , i.e. and . If , then , which is impossible. If , then . The cases , and are impossible. If , then . It follows that , , i.e. and . If then from (1) it follows that . Then , from where we have or , which contradicts the assumption that . Therefore the solutions to the equation are .
By multiplying the equation by , we get . Since is a natural number, is also a natural number. Therefore, , i.e. If , then and hence or , which is impossible. If , then . If , then . It follows that , , i.e. and . If , then , which is impossible. If , then . The cases , and are impossible. If , then . It follows that , , i.e. and . If then from (1) it follows that . Then , from where we have or , which contradicts the assumption that . Therefore the solutions to the equation are .
Final answer
(5, 2), (5, 3)
Techniques
Greatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalities