Problem:
Let be a prime number. Furthermore, let be integers which satisfy the equations .
Prove that then holds.
Problem:
Let be a prime number. Furthermore, let be integers which satisfy the equations .
Prove that then holds.
Solution:
If two of the three numbers are equal, then, because of the cyclic interchangeability, we may assume without loss of generality that . Then the left given equation becomes , from which, since , it follows directly that , so that the claim is fulfilled. In the following we may therefore assume .
Rearranging the equations gives
Multiplying the three terms and cancelling gives
Of the three given numbers, by the pigeonhole principle at least two are even or at least two are odd; their sum is therefore divisible by . Hence the product on the right-hand side of (1) is even. It follows that and therefore .
If two of the brackets in (2) are equal, then without loss of generality let . It follows directly that and therefore the equality of all three given numbers.
If exactly one of the brackets is odd (equal to ), then is on the one hand odd, and on the other hand equal to , hence even – a contradiction!
There remain therefore (up to cyclic interchangeability) the cases () to be examined.
From , , it follows that , , , which, with , gives a contradiction to the first given equation.
From , , it follows that , , , which, with , gives a contradiction to the first given equation.
Therefore only is possible. Indeed, holds.