2002 AMC 12A 第 21 题

先试着解答 2002 AMC 12A 第 21 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2002 AMC 12A 解答,或核对答案

所有题目均经美国数学协会(MAA)官方合法授权使用。

21.

考虑数列 4,7,1,8,9,7,6,4, 7, 1, 8, 9, 7, 6, \ldots。对 n>2n \gt 2, 第 nn 项是前两项之和的个位数字。令 SnS_n 表示该数列前 nn 项的和。使 Sn>10,000S_n \gt 10{,}000 的最小 nn

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

答案:B
知识点:个位数字求和找规律
难度评级:1840
解答:

继续写数列得到 4,7,1,8,9,7,64, 7, 1, 8, 9, 7, 63,9,2,1,3,4,7,1,3, 9, 2, 1, 3, 4, 7, 1, \ldots, 它以 1212 为周期重复。每个 1212 项循环的和为 6060

满足 60k10,00060k \le 10{,}000 的最大 kkk=166k = 166, 因此 S12166=9960S_{12\cdot 166} = 9960。 再加上下一轮的 4,7,1,8,9,7,64, 7, 1, 8, 9, 7, 6,增加 4242, 总和超过 10,00010{,}000。 所以 n=12166+7=1999n = 12\cdot 166 + 7 = 1999

因此,正确答案是 B

Continuing the sequence gives 4,7,1,8,9,7,6,4, 7, 1, 8, 9, 7, 6, 3,9,2,1,3,4,7,1,,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.

← 第 20 题#20
完整试卷

其他年份的第 21 题