Skip to main content
OlympiadHQ

Browse · MathNet

Print

Austria 2014

Austria 2014 number theory

Problem

The sequence is defined by the recursion and the set of starting values . (i.e., the starting values are these three numbers in arbitrary order.) Show that the sequence does not contain any sixth power of an integer.
Solution
We consider second, third and sixth powers modulo 7:
x
0000
1111
2411
3261
4211
5461
6161
In order to show that no element of the sequence is a sixth power, it is sufficient to show that no such element is congruent to 0 or 1 modulo 7. We prove this by induction. We wish to prove: and for all indices . We can start the induction by noting that the values for the first three elements of the sequence modulo 7 are , and . We now wish to show that the assumption "none of the elements , or is congruent to 0 or 1 modulo 7" implies " is not congruent to 0 or 1 modulo 7" for all indices .

By definition of the sequence, we have . By the assumption of the induction, we know that holds. The second expression in the sum, , can only assume the values 3 or 4 modulo 7 (since can only take on the values from 2 through 6 modulo 7, and a third power of this can therefore only assume the values 1 or 6). By the same argument, the final expression in the sum, , can only assume the values 1, 2 or 4. Summing all possible values, we see that can only be congruent to 2, 3, 4, 5 or 6 modulo 7, which completes the induction.

Techniques

Fermat / Euler / Wilson theoremsRecurrence relations