# Understand the problem

The sequence of positive integers satisfies for .

Prove that there exists at most one for which is the cube of an integer.

Prove that there exists at most one for which is the cube of an integer.

##### Source of the problem

Ireland MO 2018, Problem 9

##### Topic

Number Theory

##### Difficulty Level

8/10

##### Suggested Book

Excursion in Mathematics by Bhaskaryacharya Prathisthan

# Start with hints

Do you really need a hint? Try it first!

, wIt is so important to know and use the modulo technqiue at the right time. We will use the modulo technique, i.e. we will see the problem through the lens of modulo some number. What is that number? If you visit this website, you will understand that to handle cubes modulo something is 9. So, we will deal the whole equation modulo 9.

**Definition**: kth power residue of a number n is the complete residue system modulo n. For eg: Quadratic Residue (2nd power) of 4 is {0,1}.

- Cubic(3rd) Power Residue of 9 is {0,1,-1}.
- 6th Power Residue of 9 is {0,1}
- Quadratic(2nd Power) Residue of 9 is {0,1,4,7}

Let be the smallest integer which is a cube; let . Note that, . Now, the modulo picture comes in. Starting from this cube. We will observe the sequence modulo 9. Case 1: \( a_k = 0\) mod 9 Then, the sequence modulo 9 will be Hence, there are no further cubes possible as the cubic residues of 9 are {0,1,-1}.

Case 2: \( a_k = 1,-1\) mod 9 Then, the sequence modulo 9 will be Hence, there are no further cubes possible as the cubic residues of 9 are {0,1,-1}. QED

# Watch video

# Connected Program at Cheenta

#### Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Google