Skip to main content
OlympiadHQ

Browse · MathNet

Print

Austria 2010

Austria 2010 number theory

Problem

Determine all tripels of positive integers , such that holds.
Solution
We first note that the right-hand side of the equation is odd. We therefore know that is odd, and therefore is odd. One of the neighbors of must therefore be divisible by , and we therefore have with and odd.

Let us first assume . If , we first note that holds, and therefore, since must contain all odd factors of , which contradicts . We therefore have , and . The only possible value for is then , since holds for any . Any possible solution in this case must therefore have , and therefore . If , we obtain and , which contradicts . For any however, we obviously have and holds, since is certainly true. All tripels are therefore solutions for .

Now let us assume . If , we have , and therefore which again contradicts , and we once again have . If , possible values for are either or , since for any . We therefore have two further groups of solutions. In the first case, we have , and therefore . If , we obtain , and , which contradicts . If , we obtain , and again contradicting . If however, holds, since is certainly true. All tripels are therefore solutions for .

Finally, if and , we have . If , we obtain and , which again contradicts . If however, holds, since is again true. All tripels are therefore also solutions for .

Summarizing, the solutions are given by the tripels
Final answer
(2^p + 1, 2^{p-1} + 1, p + 1) for p > 2; (2^p - 1, 2^{p-1} - 1, p + 1) for p > 3; (2^p - 1, 2^p - 2, p) for p > 2.

Techniques

Techniques: modulo, size analysis, order analysis, inequalitiesFactorization techniques