ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a cycle of reduced forms have caliber ll, discriminant a2+4a^2+4, and sum nn. Regularity conjecture. There is an integer r≥0r\geq 0 such that

n=(2r+1)l+1.n=(2r+1)l+1.

If r>0r>0, the cycle consists of imprimitive forms, meaning that the greatest common divisor of the coefficients of each form is greater than 11. These conjectured regularities arise from computational evidence concerning cycles with fixed sum; the source does not provide a proof or resolution.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.