Browse · MathNet
PrintMMO2025 Round 2
Mongolia 2025 number theory
Problem
Show that the equation has no integer solutions.
Solution
Suppose there exist integers and such that .
Let us consider the equation modulo .
First, note that or for any integer , since by Fermat's Little Theorem, if is not divisible by , and otherwise.
So or .
Now, , so or .
Therefore, or .
Let us compute for all :
- : - : - : - : - : - : - :
So the possible residues are modulo .
But or , which are not among the possible residues for .
Therefore, there are no integer solutions to the equation.
Let us consider the equation modulo .
First, note that or for any integer , since by Fermat's Little Theorem, if is not divisible by , and otherwise.
So or .
Now, , so or .
Therefore, or .
Let us compute for all :
- : - : - : - : - : - : - :
So the possible residues are modulo .
But or , which are not among the possible residues for .
Therefore, there are no integer solutions to the equation.
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesFermat / Euler / Wilson theoremsPolynomials mod p