The conjecture on the error in estimated numbers of discrete logarithm fixed points
Statement
Let be prime, let and range over the parameters defining the fixed-point counting function, and let denote the corresponding estimate. For every fixed , consider primes for which its deviation from exceeds . The error-distribution conjecture. There are primes for which
for every . This is motivated by an independence heuristic: the expected value of the relevant random model is , while its standard deviation is less than for every when is sufficiently large. The statement predicts that only a negligible number of primes have a larger error, but no proof or resolution is supplied here.
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.