2002 AMC 12A Problem 21

Below is the professionally curated solution for Problem 21 of the 2002 AMC 12A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2002 AMC 12A 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:units digitsummationpattern recognition

Difficulty rating: 1840

21.

Consider the sequence of numbers 4,7,1,8,9,7,6,4, 7, 1, 8, 9, 7, 6, \ldots For n>2,n \gt 2, the nnth term of the sequence is the units digit of the sum of the two previous terms. Let SnS_n denote the sum of the first nn terms of this sequence. The smallest value of nn for which Sn>10,000S_n \gt 10{,}000 is

19921992

19991999

20012001

20022002

20042004

Solution:

Continuing the sequence gives 4,7,1,8,9,7,6,3,9,2,1,3,4,7,1,,4, 7, 1, 8, 9, 7, 6, 3, 9, 2, 1, 3, 4, 7, 1, \ldots, which repeats with period 12.12. Each block of 1212 terms sums to 60.60.

The largest kk with 60k10,00060k \le 10{,}000 is k=166,k = 166, giving S12166=9960.S_{12\cdot 166} = 9960. Adding the next terms 4,7,1,8,9,7,64, 7, 1, 8, 9, 7, 6 contributes 42,42, pushing the total past 10,000.10{,}000. So n=12166+7=1999.n = 12\cdot 166 + 7 = 1999.

Thus, the correct answer is B.

Problem 21 in Other Years