The four-squares conjecture for unrestricted unit-power Pell sequences
The four-squares conjecture for unrestricted unit-power Pell sequences
Let , and be positive integers such that is not a square, let have norm
and let be a unit in . Define sequences and by
Unrestricted-power four-squares conjecture. There are at most four distinct integer squares among the . If is a prime power or a perfect square, then there are at most three distinct integer squares among the . This is a proposed strengthening of the even-power sequence conjecture, obtained by allowing all integer powers of the unit; it likewise concerns square values in families of solutions to the generalized Pell equation .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Paul M Voutier, “Bounds on the number of squares in recurrence sequences: y_0=b^2 (I)”, arXiv:2502.14875 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.