Browse · MathNet
PrintIRL_ABooklet_2023
Ireland 2023 number theory
Problem
Find all integer solutions to the equation
Solution
Note that and let be a solution. If we assume that is not divisible by , there exists a number such that . We then have hence . This implies that , because On the other hand, by Fermat's little theorem, . Then , hence . But for these two values of we get , a contradiction. Hence, must be divisible by .
It follows that must also be divisible by , and we look for solutions . Let and note that Then , iff , or equivalently Because and is not a square, to find solutions to this equation we only need to consider . To a solution with negative there corresponds one with positive , obtained by changing the signs of both, and . Because , , and , we have these three cases for solutions with positive The possibilities for solutions with positive are therefore Thus we obtain solutions to the original equation, namely and all the variants , , of these.
It follows that must also be divisible by , and we look for solutions . Let and note that Then , iff , or equivalently Because and is not a square, to find solutions to this equation we only need to consider . To a solution with negative there corresponds one with positive , obtained by changing the signs of both, and . Because , , and , we have these three cases for solutions with positive The possibilities for solutions with positive are therefore Thus we obtain solutions to the original equation, namely and all the variants , , of these.
Final answer
The integer solutions are (17, 51), (-17, -51), (51, 17), (-51, -17), (34, 51), (-34, -51), (51, 34), (-51, -34), (-17, 34), (17, -34), (34, -17), and (-34, 17).
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesFermat / Euler / Wilson theoremsMultiplicative order