Bounds on the number of squares in recurrence sequences: y 0=b squared (II)

arXiv:2610.35158 · math.NT · Submitted 2026-10-26 · Read on arXiv

math.NT

Submitted: 2026-10-26

Updated: 2026-10-26

Comments: published, with corrections

Journal ref: Research in Number Theory, volume 12, article 6 (2026)

DOI: 10.1007/s40993-025-00696-w

License: http://creativecommons.org/licenses/by-nc-sa/4.0/

The gist: For binary recurrence sequences, (y k) k in, arising from the solutions of generalised Pell equations, X squared-dY squared=c…

Abstract

For binary recurrence sequences, (y k) k in, arising from the solutions of generalised Pell equations, X squared-dY squared=c, where y 0 is any positive square and c=-2p m for an odd prime p and non-negative integers and m, we show that there are at most 4 distinct squares with y k sufficiently large. From this result, we also show that there are at most 7 distinct squares when y 0=1,2 squared,,7 squared, or once d exceeds an explicit lower bound, without any conditions on the size of such squares.

Related papers