benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / The Fibonacci numbers F₀,F₁,F₂,... are defined inductively by F₀=0,F₁=1, and F_(n+1)=F_(n)+F_(n−1) for n≥1. Given an integer n≥2, determine the smallest size of a set S of integers… · Discussion

Discussing The Fibonacci numbers F₀,F₁,F₂,... are defined inductively by F₀=0,F₁=1, and F_(n+1)=F_(n)+F_(n−1) for n≥1. Given an integer n≥2, determine the smallest size of a set S of integers… · 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.