benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A sequence (x_(n))_(n≥0) is defined as follows: x₀=a,x₁=2 and x_(n)=2x_(n−1)x_(n−2)−x_(n−1)−x_(n−2)+1 for all n>1. Find all integers a such that 2x_(3n)−1 is a perfect square for a… · Discussion

Discussing A sequence (x_(n))_(n≥0) is defined as follows: x₀=a,x₁=2 and x_(n)=2x_(n−1)x_(n−2)−x_(n−1)−x_(n−2)+1 for all n>1. Find all integers a such that 2x_(3n)−1 is a perfect square for a… · 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.