The four-squares conjecture for generalized Pell sequences
The four-squares conjecture for generalized Pell sequences
Let , and be positive integers such that is not a square, let have norm
and let be a unit in with and positive integers. Define integer sequences and by
Assume that is the smallest square among the and let denote the unique squarefree integer such that is a square. Four-squares conjecture. There are at most four distinct integer squares among the . If for an odd prime , then there are at most three distinct integer squares among the . Furthermore, if is a perfect square, then there are at most two distinct integer squares among the . These sequences give solutions to the generalized Pell equation , and the conjecture predicts strong bounds on square values in such sequences; the sharper bounds depend on the arithmetic of the norm .
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).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.