benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / The Fibonacci sequence F₁,F₂,F₃,… is defined by F₁=F₂=1 and F_(n+2)=F_(n+1)+F_(n). Find the least positive integer t such that for all n>0,F_(n)=F_(n+t). · Discussion

Discussing The Fibonacci sequence F₁,F₂,F₃,… is defined by F₁=F₂=1 and F_(n+2)=F_(n+1)+F_(n). Find the least positive integer t such that for all n>0,F_(n)=F_(n+t). · Omni-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.