2017 AMC 10A Problem 13

Below is the professionally curated solution for Problem 13 of the 2017 AMC 10A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2017 AMC 10A 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:Fibonaccimodular arithmeticpattern recognition

Difficulty rating: 1140

13.

Define a sequence recursively by F0=0, F1=1,F_{0}=0,~F_{1}=1, and Fn=F_{n}= the remainder when Fn1+Fn2F_{n-1}+F_{n-2} is divided by 3,3, for all n2.n\geq 2. Thus the sequence starts 0,1,1,2,0,2,.0,1,1,2,0,2,\ldots. What is F2017+F2018+F2019+F2020+F_{2017}+F_{2018}+F_{2019}+F_{2020}+F2021+F2022+F2023+F2024?F_{2021}+F_{2022}+F_{2023}+F_{2024}?

66

77

88

99

1010

Solution:

Let us list out the first few values to see if we can find a pattern in this sequence.

0,1,1,2,0,2,2,1,0,1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, \cdots

From this we can see that the pattern repeats every 88 terms.

The desired answer is the sum of 88 consecutive numbers, which is fixed. This sum is 0+1+1+2+0+2 0 + 1 + 1 + 2 + 0 + 2+2+1=9. + 2 + 1 = 9. Thus, D is the correct answer.

Problem 13 in Other Years