Browse · MathNet
PrintTeam Selection Test for EGMO 2023
Turkey 2023 number theory
Problem
Find all prime numbers satisfying the equation
Solution
We are to find all prime numbers such that
First, note that both sides are positive for positive primes .
Let us analyze the equation:
Expand the left side:
Bring all terms to one side:
Group terms:
Let us try small values for .
Try :
Try small prime values for : - : - : - :
So works with .
Now try :
Try small prime values for : - : - : - : - : - : - :
No solution for and small .
Try : Try : Try :
Try : Try : Try :
Try : Try : So , is a solution (already found).
Try : Try : Try :
Try : Try : Try :
Now, consider the degree of the equation. For large , the left side grows much faster than the right side, so only small values are possible.
Now, check for : So or , which has no positive integer solution for .
Now, try to check modulo for possible contradictions for : If , is odd and or .
Compute : - if - - So So
The right side: But for , So
So If : , contradiction. If : But is a prime , so or . Try : But already checked.
Thus, for , there is a contradiction modulo .
Therefore, the only possible values are or .
For , is a solution. For , as above, has no integer solution for .
Therefore, the only solution is .
Answer: The only pair of prime numbers satisfying the equation is .
First, note that both sides are positive for positive primes .
Let us analyze the equation:
Expand the left side:
Bring all terms to one side:
Group terms:
Let us try small values for .
Try :
Try small prime values for : - : - : - :
So works with .
Now try :
Try small prime values for : - : - : - : - : - : - :
No solution for and small .
Try : Try : Try :
Try : Try : Try :
Try : Try : So , is a solution (already found).
Try : Try : Try :
Try : Try : Try :
Now, consider the degree of the equation. For large , the left side grows much faster than the right side, so only small values are possible.
Now, check for : So or , which has no positive integer solution for .
Now, try to check modulo for possible contradictions for : If , is odd and or .
Compute : - if - - So So
The right side: But for , So
So If : , contradiction. If : But is a prime , so or . Try : But already checked.
Thus, for , there is a contradiction modulo .
Therefore, the only possible values are or .
For , is a solution. For , as above, has no integer solution for .
Therefore, the only solution is .
Answer: The only pair of prime numbers satisfying the equation is .
Final answer
p = 2, q = 5
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesPolynomials mod p