Select Page

# Understand the problem

The sequence of positive integers $a_1, a_2, a_3, ...$ satisfies $a_{n+1} = a^2_{n} + 2018$ for $n \ge 1$.
Prove that there exists at most one $n$ for which $a_n$ is the cube of an integer.

##### Source of the problem

Ireland MO 2018, Problem 9

Number Theory
8/10
##### Suggested Book
Excursion in Mathematics by Bhaskaryacharya Prathisthan

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}
We will use these ideas here.
Let $a_k$ be the smallest integer which is a cube; let $a_k=a^3$. Note that, $a_{k+1}=a^6+2018$. 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 $0 \mapsto 2 \mapsto 6 \mapsto 2 \mapsto \dots$ 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 $\pm 1 \mapsto 3 \mapsto 2 \mapsto 6 \mapsto 2 \mapsto \dots$ Hence, there are no further cubes possible as the cubic residues of 9 are {0,1,-1}. QED

# Connected Program at Cheenta

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.

# Similar Problems

## RMO 2019 (Maharashtra Goa) Adding GCDs

Can you add GCDs? This problem from RMO 2019 (Maharashtra region) has a beautiful solution. We also give some bonus questions for you to try.

## Number Theory, Ireland MO 2018, Problem 9

This problem in number theory is an elegant applications of the ideas of quadratic and cubic residues of a number. Try with our sequential hints.

## Number Theory, France IMO TST 2012, Problem 3

This problem is an advanced number theory problem using the ideas of lifting the exponents. Try with our sequential hints.

## Algebra, Austria MO 2016, Problem 4

This algebra problem is an elegant application of culminating the ideas of polynomials to give a simple proof of an inequality. Try with our sequential hints.

## Number Theory, Cyprus IMO TST 2018, Problem 1

This problem is a beautiful and simple application of the ideas of inequality and bounds in number theory. Try with our sequential hints.

## Number Theory, South Africa 2019, Problem 6

This problem in number theory is an elegant applciations of the modulo technique used in the diophantine equations. Try with our sequential hints

## Number Theory, Korea Junior MO 2015, Problem 7

This problem in number theory is an elegant application of the ideas of the proof of infinitude of primes from Korea. Try with our sequential hints.

## Inequality, Israel MO 2018, Problem 3

This problem is a basic application of triangle inequality along with getting to manipulate the modulus function efficently. Try with our sequential hints.

## Number Theory, Greece MO 2019, Problem 3

This problem is a beautiful application of prime factorization theorem, and reveal how important it is. Try with our sequential hints.

## Algebra, Germany MO 2019, Problem 6

This problem is a beautiful application of algebraic manipulations, ideas of symmetry, and vieta’s formula in polynomials. Try with our sequential hints.