The four-squares conjecture for generalized Pell sequences

Let aa, bb and dd be positive integers such that dd is not a square, let α=a+b2d\alpha=a+b^{2}\sqrt{d} have norm

Nα=a2b4d,N_{\alpha}=a^{2}-b^{4}d,

and let ε=(t+ud)/2\varepsilon=(t+u\sqrt{d})/2 be a unit in OQ(d)\mathcal{O}_{\mathbb{Q}(\sqrt{d})} with tt and uu positive integers. Define integer sequences (xk)k=(x_k)_{k=-\infty}^{\infty} and (yk)k=(y_k)_{k=-\infty}^{\infty} by

xk+ykd=αε2k.x_k+y_k\sqrt{d}=\alpha\varepsilon^{2k}.

Assume that b2=y0b^2=y_0 is the smallest square among the yky_k and let sf(n)\operatorname{sf}(n) denote the unique squarefree integer such that n/sf(n)n/\operatorname{sf}(n) is a square. Four-squares conjecture. There are at most four distinct integer squares among the yky_k. If sf(Nα)2p\operatorname{sf}(|N_{\alpha}|)\mid 2p for an odd prime pp, then there are at most three distinct integer squares among the yky_k. Furthermore, if Nα|N_{\alpha}| is a perfect square, then there are at most two distinct integer squares among the yky_k. These sequences give solutions to the generalized Pell equation x2dy2=Nαx^2-dy^2=N_{\alpha}, and the conjecture predicts strong bounds on square values in such sequences; the sharper bounds depend on the arithmetic of the norm NαN_{\alpha}.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.