Maths Olympiad Prep

Library / /34 of 75

Algebra Difficulty 4.8 AIME Find the answer Italy

Problem:

The sequence ana_{n} is constructed as follows: a1,a2a_{1}, a_{2} are integers between 1 and 9 (endpoints included); for n3n \geq 3, if the sum of an1a_{n-1} and an2a_{n-2} consists of a single digit, then that sum is the value of ana_{n}; if instead an1+an2a_{n-1}+a_{n-2} has more than one digit, the sum of its digits will be the value of ana_{n} (for example, if a4=7a_{4}=7 and a5=8a_{5}=8, then a6=6a_{6}=6 since 7+8=157+8=15 and 1+5=61+5=6 ). How many possible choices of the pair (a1,a2)\left(a_{1}, a_{2}\right) are there such that a2023=9a_{2023}=9?

Pick one

Solution

Solution:

The answer is (C)\mathbf{( C )}. Observe that for n3,ann \geq 3, a_{n} is the number in {1,,9}\{1, \ldots, 9\} given by the remainder of the division by 9 of an2+an1a_{n-2}+a_{n-1} (where 9 represents remainder 0). In particular, an2a_{n-2} is the remainder (as above, taken in {1,,9}\{1, \ldots, 9\}) in the division by 9 of anan1a_{n}-a_{n-1}. Setting a2023=9a_{2023}=9, for each of the 9 possible choices of the value of a2022a_{2022}, the value of a2021a_{2021} is determined, and similarly all the other values of the sequence are determined: these 9 choices thus lead us to 9 possible choices of the pair (a1,a2)\left(a_{1}, a_{2}\right).

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from it; metadata (topic, difficulty) added by this project.