benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Fibonacci numbers are defined as follows: F₀=F₁=1,F_(n+2)=F_(n+1)+F_(n),n≥0. Let a_(n) be the number of words that consist of n letters 0 or 1 and contain no two letters 1 at dista… · Discussion

Discussing Fibonacci numbers are defined as follows: F₀=F₁=1,F_(n+2)=F_(n+1)+F_(n),n≥0. Let a_(n) be the number of words that consist of n letters 0 or 1 and contain no two letters 1 at dista… · 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.