2000 AMC 10 第 6 题

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

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

6.

Fibonacci 数列 1,1,2,3,5,8,13,21,1, 1, 2, 3, 5, 8, 13, 21, \ldots 以两个 11 开始,之后每一项都是前两项之和。十个数字中,哪一个最晚出现在 Fibonacci 数列某一项的个位上?

The Fibonacci sequence 1,1,2,3,5,8,13,21,1, 1, 2, 3, 5, 8, 13, 21, \ldots starts with two 11s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci sequence?

00

44

66

77

99

答案:C
知识点:斐波那契数列个位数字找规律
难度评级:1240
解答:

只记录个位数,得到 1,1,2,3,5,8,3,1,4,5,9,4,3,7,0,7,7,4,1,5,6, \begin{gathered} 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, \\ 4, 3, 7, 0, 7, 7, 4, 1, 5, 6, \ldots \end{gathered}

依次查看每个数字第一次出现的位置,数字 66 是十个数字中最后出现的。

所以正确答案是 C

Recording only the units digits gives the sequence 1,1,2,3,5,8,3,1,4,5,9,4,3,7,0,7,7,4,1,5,6, \begin{gathered} 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, \\ 4, 3, 7, 0, 7, 7, 4, 1, 5, 6, \ldots \end{gathered}

Scanning for the first appearance of each digit, the digit 66 is the last of the ten digits to show up.

Thus, the correct answer is C.

← 第 5 题#5
完整试卷

其他年份的第 6 题