Generalized conjecture on squares in the associated recurrence sequence
Let , , and be positive integers with nonsquare, let have norm , and let be a unit in with positive integers. Define by replacing in
with , so that is the coefficient of in . Generalized 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 generalizes the first bound to the sequence obtained using all powers of the unit rather than only even powers, and remains unresolved in the supplied source.
References
- Paul M Voutier, “Bounds on the number of squares in recurrence sequences”, arXiv:2401.01293 (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.