2000 AMC 10 Problem 6

Attempt Problem 6 of the 2000 AMC 10 below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2000 AMC 10 solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

6.

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

Answer: C
Concepts:Fibonacciunits digitpattern recognition
Difficulty rating: 1240
Solution:

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.

← Problem 5#5
Full Exam

Problem 6 in Other Years