Conjecture on descents in the sequence of rational-square counts
Statement
Let be a positive integer, and let denote the sequence defined in the paper, counting the relevant rational squares at parameter . Assume that neither nor is a square integer.
Descent conjecture. For every integer , there exists some such that
and
This conjecture proposes that, except when or is a square integer, the sequence is not non-decreasing: every positive value occurs immediately before a drop to . The supplied text presents this as a proposal based on computational observations; no resolution is given.
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.