Benford error conjecture for Mersenne numbers
Statement
Let , where is the -th prime, let denote the leading digit of , and define the Benford error by
Here is the Benford probability of the digit . Benford error conjecture. For any fixed , the errors satisfy
and
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.