ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be prime, let gg and hh range over the parameters defining the fixed-point counting function, and let N,gANY,hANY(p)N_{, g \mathop\mathsf{ANY}, h \mathop\mathsf{ANY}}(p) denote the corresponding estimate. For every fixed ϵ>0\epsilon>0, consider primes p≤xp\leq x for which its deviation from p−1p-1 exceeds p1/2+ϵp^{1/2+\epsilon}. The error-distribution conjecture. There are o(x/ln⁡x)o(x/\ln x) primes p≤xp\leq x for which

∣N,gANY,hANY(p)−(p−1)∣>p1/2+ϵ\left|N_{, g \mathop\mathsf{ANY}, h \mathop\mathsf{ANY}}(p)-(p-1)\right|>p^{1/2+\epsilon}

for every ϵ>0\epsilon>0. This is motivated by an independence heuristic: the expected value of the relevant random model is p−1p-1, while its standard deviation is less than p1/2+ϵp^{1/2+\epsilon} for every ϵ>0\epsilon>0 when pp 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 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.