Conjectures for two-cycles with arbitrary and primitive-root conditions
Statement
Let be prime. For conditions on and , let denote the number of corresponding two-cycle solutions modulo , where means primitive root, means unrestricted, and denotes any one of the four conditions used on .
Two-cycle counting conjectures. The paper conjectures
It further conjectures
These heuristic formulas concern the predicted numbers of solutions to the discrete-logarithm two-cycle equations under various primitive-root restrictions. The source presents them as conjectural birthday-paradox estimates; no resolution is supplied.
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.