benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let F_(m) be the mth Fibonacci number, defined by F₁=F₂=1 and F_(m)=F_(m−1)+F_(m−2) for all m≥3. Let p(x) be the polynomial of degree 1008 such that p(2n+1)=F_(2n+1) for … · Discussion

Discussing Let F_(m) be the mth Fibonacci number, defined by F₁=F₂=1 and F_(m)=F_(m−1)+F_(m−2) for all m≥3. Let p(x) be the polynomial of degree 1008 such that p(2n+1)=F_(2n+1) for … · 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.