The four-squares conjecture for unrestricted unit-power sequences
The four-squares conjecture for unrestricted unit-power sequences
Let , and be positive integers such that is not a square. Set
and let be a unit in with positive integers. Define sequences and by
The unrestricted 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 . The conjecture extends the even-power sequence problem to all powers of the unit; the special norm conditions predict a stronger bound, but no resolution is supplied in the source.
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: arbitrary b, III”, arXiv:2504.07040 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.