ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Mn=2pn−1M_n=2^{p_n}-1, where pnp_n is the nn-th prime, and let P(d)P(d) denote the Benford probability of leading digit dd. The waiting time between successive occurrences of a leading digit dd 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 {Mn}\{M_n\} has Benford-distributed waiting times: for each leading digit dd, these waiting times behave like geometric random variables with parameter p=P(d)p=P(d). 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 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.