ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Mn=2pn−1M_n=2^{p_n}-1, where pnp_n is the nn-th prime, let D(Mn)D(M_n) denote the leading digit of MnM_n, and define the Benford error by

Ed(N)=#{n≤N:D(Mn)=d}−NP(d).E_d(N)=\#\{n\leq N:D(M_n)=d\}-NP(d).

Here P(d)P(d) is the Benford probability of the digit dd. Benford error conjecture. For any fixed ϵ>0\epsilon>0, the errors satisfy

Ed(N)=O(N1/2+ϵ)E_d(N)=O(N^{1/2+\epsilon})

and

Ed(N)≠O(N1/2−ϵ).E_d(N)\not=O(N^{1/2-\epsilon}).

The proved global Benford law gives only the limiting frequencies, whereas this conjecture predicts square-root-scale fluctuations and an essentially optimal upper bound; it remains open.

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.