olymmath

AMC 10 2017a Problem 13

  • Paper

Define a sequence recursively by F0=0, F1=1,F_{0}=0,~F_{1}=1, and Fn=F_{n}= the remainder when Fn−1+Fn−2F_{n-1}+F_{n-2} is divided by 3,3, for all n≥2.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+F2021+F2022+F2023+F2024?F_{2017}+F_{2018}+F_{2019}+F_{2020}+F_{2021}+F_{2022}+F_{2023}+F_{2024}? (A) 6(B) 7(C) 8(D) 9(E) 10\textbf{(A)}\ 6 \textbf{(B)}\ 7 \textbf{(C)}\ 8 \textbf{(D)}\ 9 \textbf{(E)}\ 10

Dataset text NuminaMath-1.5. Quoted with source.

Show the answer

9

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc10/2017a/p13 · Tag 3HS7534HG8 · Edit this page on GitHub · Keys: j next, k previous