Skip to main content
OlympiadHQ

Browse · MathNet

Print

AustriaMO2011

Austria 2011 number theory

Problem

Determine all integer solutions of the equation .
Solution
Clearly, we have solutions for any value of , if we also have . We claim that there are no other solutions.

In order to show this, we first assume that is even. In this case, the number is a perfect square, and therefore must also be a perfect square. The only value of for which both and can be perfect squares is , and we therefore have (and thus also ) in this case.

Now, assume that is positive and odd. Let . Since is divisible by and can only be congruent to , , or modulo , it follows that must be divisible by . Let and with and not divisible by . The given equation can now be written as which yields a contradiction, since the left-hand side of this expression is exactly divisible by an even number of sevens, while the right-hand side is exactly divisible by an odd number of sevens.

Finally, assume that is negative and let . In this case the equation can be written in the equivalent form . If is even, we once again note that both and must be perfect squares, and as before this means that must follow. If is odd, we can write , and the same argument as before will hold, with and yielding as a contradiction.
Final answer
(x, y, z) = (0, 0, z) for all integers z; no other integer solutions exist.

Techniques

Techniques: modulo, size analysis, order analysis, inequalitiesGreatest common divisors (gcd)Prime numbers