Skip to main content
OlympiadHQ

Browse · MathNet

Print

59th Ukrainian National Mathematical Olympiad

Ukraine number theory

Problem

Sequence of positive integers is defined by , where is some positive integer. Prove that in this sequence no more than one number can be a cube of a positive integer number.
Solution
Suppose there is more than one number, which is a cube of a positive integer. Let be the smallest of all possible cubes. Then, it gives modulo , hence, . From now on, we write all remainders modulo . Let us list all the cases.

and and and , and there cannot be any more cubes.

and and , and there cannot be any more cubes.

Techniques

Modular ArithmeticRecurrence relations