benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / For n≥0, let F_(n) denote the nth Fibonacci number (that is, F₀=0,F₁=1, and F_(n)=F_(n−1)+F_(n−2) for all n≥2). What is the greatest possible value of the greatest common divisor o… · Discussion

Discussing For n≥0, let F_(n) denote the nth Fibonacci number (that is, F₀=0,F₁=1, and F_(n)=F_(n−1)+F_(n−2) for all n≥2). What is the greatest possible value of the greatest common divisor o… · 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.