benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let (F_(n)) be the sequence defined recursively by F₁=F₂=1 and F_(n+1)=F_(n)+F_(n−1) for n≥2. Find all pairs of positive integers (x,y) such that 5F_(x)−3F_(y)=1. · Discussion

Discussing Let (F_(n)) be the sequence defined recursively by F₁=F₂=1 and F_(n+1)=F_(n)+F_(n−1) for n≥2. Find all pairs of positive integers (x,y) such that 5F_(x)−3F_(y)=1. · 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.