Two-cycle count conjectures from the auxiliary heuristic
Statement
Let be prime, and let count two-cycles with the restrictions indicated by and . Let be Euler's totient function.
Two-cycle count conjectures.
The source derives these predictions using a heuristic relating the auxiliary equation to two-cycles; 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.