Browse · MathNet
Print33rd Hellenic Mathematical Olympiad
Greece number theory
Problem
Find all possible triads of non negative integers with , which satisfy the equation:
Solution
We distinguish the cases:
If , then the equation becomes . Then must be multiples of , that is , , , and the equation becomes , hence , that is .
If , then (since ) and , and therefore must divide the left part, that is . The possible remainders of the division of a square by are the same as the remainders of the numbers , that is . Therefore, in order to have we need , . We write and , with .
By substitution in (1) we get .
If , then , and then we conclude that , absurd.
If , then . Hence . Since , we have . If , we find the solutions . Therefore we have the solutions: .
If , then the equation becomes . Then must be multiples of , that is , , , and the equation becomes , hence , that is .
If , then (since ) and , and therefore must divide the left part, that is . The possible remainders of the division of a square by are the same as the remainders of the numbers , that is . Therefore, in order to have we need , . We write and , with .
By substitution in (1) we get .
If , then , and then we conclude that , absurd.
If , then . Hence . Since , we have . If , we find the solutions . Therefore we have the solutions: .
Final answer
[(4, 8, 0), (35, 70, 1), (14, 77, 1)]
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesFactorization techniques