benchmarks.wiki / Public workspace

MATH / Define a sequence recursively by F_{0}=0,~F_{1}=1, and F_(n) be the remainder when F_(n−1)+F_(n−2) is divided by 3, for all n≥2. Thus the sequence starts 0,1,1,2,0,2,… What is …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Define a sequence recursively by $F_{0}=0,~F_{1}=1,$ and FnF_{n} be 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 $F_{2017}+F_{2018}+F_{2019}+F_{2020}+F_{2021}+F_{2022}+F_{2023}+F_{2024}?$
Plain-text mathematical notation (without MathML)
Define a sequence recursively by $F_{0}=0,~F_{1}=1,$ and F_(n) be the remainder when F_(n−1)+F_(n−2) is divided by 3, for all n≥2. Thus the sequence starts 0,1,1,2,0,2,… What is $F_{2017}+F_{2018}+F_{2019}+F_{2020}+F_{2021}+F_{2022}+F_{2023}+F_{2024}?$
Original LaTeX notation
Define a sequence recursively by $F_{0}=0,~F_{1}=1,$ and $F_{n}$ be 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}?$

level

Level 3

type

Intermediate Algebra

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import