Browse · MathNet
PrintSelection and Training Session
Belarus number theory
Problem
Find all integers and satisfying the equality
Solution
(Solution of D. Babrou.) If or , then we see that only the pairs , satisfy the equation .
Let now and . We rewrite the equation in the form . Setting , () we obtain .
It is easy to verify that the least possible with is , hence we have .
Similarly we conclude that because the least with is . So, .
Further, the smallest positive such that is 18, so . Since , we have , then .
The smallest positive such that , hence . Since , we have . Then .
The order of 5 modulo 13 is 4, hence , thus . Then .
Since , , where 601 is a prime number, we have hence also . Note that .
Let be the order 3 modulo 601. If , then is a divisor of 120 (since ). So if , then , and .
We have .
If , then since 7 is not a divisor of 600. Next , indeed.
Therefore , so .
Further, since , it follows that , but if , then . Thus contrary to . Therefore the only pairs mentioned above are the solutions of given equation.
Let now and . We rewrite the equation in the form . Setting , () we obtain .
It is easy to verify that the least possible with is , hence we have .
Similarly we conclude that because the least with is . So, .
Further, the smallest positive such that is 18, so . Since , we have , then .
The smallest positive such that , hence . Since , we have . Then .
The order of 5 modulo 13 is 4, hence , thus . Then .
Since , , where 601 is a prime number, we have hence also . Note that .
Let be the order 3 modulo 601. If , then is a divisor of 120 (since ). So if , then , and .
We have .
If , then since 7 is not a divisor of 600. Next , indeed.
Therefore , so .
Further, since , it follows that , but if , then . Thus contrary to . Therefore the only pairs mentioned above are the solutions of given equation.
Final answer
(a, b) = (1, 0) and (a, b) = (3, 2)
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesFermat / Euler / Wilson theoremsMultiplicative orderφ (Euler's totient)Prime numbers