The four-squares conjecture for unrestricted unit-power sequences
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.