2018 AIME II Problem 2

Below is the professionally curated solution for Problem 2 of the 2018 AIME II, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2018 AIME II solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:recursionmodular arithmeticpattern recognition

Difficulty rating: 1970

2.

Let a0=2,a_0 = 2, a1=5,a_1 = 5, and a2=8,a_2 = 8, and for n>2n \gt 2 define ana_n recursively to be the remainder when 4(an1+an2+an3)4(a_{n-1} + a_{n-2} + a_{n-3}) is divided by 11.11. Find a2018a2020a2022.a_{2018} \cdot a_{2020} \cdot a_{2022}.

Solution:

Computing successive terms gives 2, 5, 8, 5, 6, 10, 7, 4, 7, 6, 2, 5, 8, 2,\ 5,\ 8,\ 5,\ 6,\ 10,\ 7,\ 4,\ 7,\ 6,\ 2,\ 5,\ 8,\ \ldots Since (a10,a11,a12)=(2,5,8)=(a0,a1,a2)(a_{10}, a_{11}, a_{12}) = (2, 5, 8) = (a_0, a_1, a_2) and each term depends only on the previous three, the sequence is periodic with period 10.10.

Therefore a2018=a8=7,a_{2018} = a_8 = 7, a2020=a0=2,a_{2020} = a_0 = 2, and a2022=a2=8,a_{2022} = a_2 = 8, so the product is 728=112.7 \cdot 2 \cdot 8 = 112.

← Problem 1Full ExamProblem 3

Problem 2 in Other Years