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

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}
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

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.

Similar Problems

Sum of Sides of Triangle | PRMO-2018 | Problem No-17

Try this beautiful Problem on Geometry from PRMO -2018.You may use sequential hints to solve the problem.

Recursion Problem | AMC 10A, 2019| Problem No 15

Try this beautiful Problem on Algebra from AMC 10A, 2019. Problem-15, You may use sequential hints to solve the problem.

Roots of Polynomial | AMC 10A, 2019| Problem No 24

Try this beautiful Problem on Algebra from AMC 10A, 2019. Problem-24, You may use sequential hints to solve the problem.

Set of Fractions | AMC 10A, 2015| Problem No 15

Try this beautiful Problem on Algebra from AMC 10A, 2015. Problem-15. You may use sequential hints to solve the problem.

Indian Olympiad Qualifier in Mathematics – IOQM

Due to COVID 19 Pandemic, the Maths Olympiad stages in India has changed. Here is the announcement published by HBCSE: Important Announcement [Updated:14-Sept-2020]The national Olympiad programme in mathematics culminating in the International Mathematical Olympiad...

Positive Integers and Quadrilateral | AMC 10A 2015 | Sum 24

Try this beautiful Problem on Rectangle and triangle from AMC 10A, 2015. Problem-24. You may use sequential hints to solve the problem.

Rectangular Piece of Paper | AMC 10A, 2014| Problem No 22

Try this beautiful Problem on Rectangle and triangle from AMC 10A, 2014. Problem-23. You may use sequential hints to solve the problem.

Probability in Marbles | AMC 10A, 2010| Problem No 23

Try this beautiful Problem on Probability from AMC 10A, 2010. Problem-23. You may use sequential hints to solve the problem.

Points on a circle | AMC 10A, 2010| Problem No 22

Try this beautiful Problem on Number theory based on Triangle and Circle from AMC 10A, 2010. Problem-22. You may use sequential hints to solve the problem.

Circle and Equilateral Triangle | AMC 10A, 2017| Problem No 22

Try this beautiful Problem on Triangle and Circle from AMC 10A, 2017. Problem-22. You may use sequential hints to solve the problem.