Benford waiting-times conjecture for Mersenne numbers
Statement
Let , where is the -th prime, and let denote the Benford probability of leading digit . The waiting time between successive occurrences of a leading digit is the number of consecutive terms between those occurrences, counted as in the paper's definition of Benford-distributed waiting times. Benford waiting-times conjecture. The sequence has Benford-distributed waiting times: for each leading digit , these waiting times behave like geometric random variables with parameter . The paper observes geometric waiting-time behavior numerically, while the corresponding local distribution properties remain conjectural.
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.