benchmarks.wiki

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 … · Discussion

Discussing 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 … · MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.