Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2017 AMC 10A Problems/Problem 13

Revision as of 15:49, 8 February 2017 by Math129 (talk | contribs) (Created page with "Define a sequence recursively by <math>F_{0}=0,~F_{1}=1,</math> and <math>F_{n}=</math> the remainder when <math>F_{n-1}+F_{n-2}</math> is divided by <math>3,</math> for all <...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Define a sequence recursively by $F_{0}=0,~F_{1}=1,$ and $F_{n}=$ the remainder when $F_{n-1}+F_{n-2}$ is divided by $3,$ for all $n\geq 2.$ Thus the sequence starts $0,1,1,2,0,2,\ldots$ What is $F_{2017}+F_{2018}+F_{2019}+F_{2020}+F_{2021}+F_{2022}+F_{2023}+F_{2024}?$

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10A_Problems/Problem_13&oldid=82869"