arXiv · 2401.01293
Bounds on the number of squares in recurrence sequences
Abstract
We investigate the number of squares in a very broad family of binary recurrence sequences with $u_{0}=1$. We show that there are at most two distinct squares in such sequences (the best possible result), except under such very special conditions where we prove there are at most three such squares.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Paul M Voutier. 2024-01-02. Bounds on the number of squares in recurrence sequences. https://doi.org/10.1016/j.jnt.2024.05.002
Cite the original work for its findings. Save a collection to share your selection of sources.