Skip to main content
OlympiadHQ

Browse · MathNet

Print

67th Romanian Mathematical Olympiad

Romania number theory

Problem

a) Prove that, for every integer , the equation has at most one integer solution.

b) Prove that the equation has exactly one integer solution.
Solution
a) Suppose that there exist two different integers and so that and . Subtracting the above yields . Since and are different, , whence . Therefore , hence . This leads to , a contradiction.

b) The equation is , so must be a positive integer; is a solution. If are positive solutions, then and , a contradiction.
Final answer
12

Techniques

Techniques: modulo, size analysis, order analysis, inequalitiesPolynomial operations