Let be a prime number. Further, let be integers that satisfy the equations .
Prove that then holds.
Solution
If two of the three numbers are equal, we can assume without loss of generality (oBdA) due to cyclic symmetry that . This transforms the given left equation to , from which follows directly because , thus satisfying the claim. Henceforth, we can assume . Rearranging the equations yields . Multiplying the three terms and simplifying gives .
Among the three given numbers, at least two are even or at least two are odd by the pigeonhole principle; their sum is therefore divisible by 2. Hence, the product on the right side of (1) is even. It follows that and therefore . (2) If two of the parentheses in (2) are equal, we can assume without loss of generality (oBdA) that . It follows directly that and hence the equality of all three given numbers.
If exactly one of the parentheses is odd (equal to ), then is on the one hand odd, and on the other hand equal to , which is even - a contradiction!
Therefore, the cases ( ) remain to be examined (up to cyclic permutation).
From it follows that , which contradicts the first given equation with .
From it follows that , which contradicts the first given equation with .
Therefore, only is possible. Indeed, holds.
Hints: From it does not follow that and vice versa, because or can be negative.
The given equations are not symmetric in , and , but only cyclic. Therefore, it is not permissible to assume without loss of generality (oBdA) that .
The claim can be generalized to all positive natural exponents .