Asymptotic persistence density conjecture for Benford sequences
Statement
Let range over integer bases greater than . A base is B-EQUI-PERS at sample size when there exists a continued-fraction convergent denominator such that , where is the next partial quotient of the continued fraction of . Asymptotic persistence density conjecture. The persistence density among integer bases converges:
Extended computation gives densities close to , while a Gauss--Kuzmin heuristic accounts for only part of the observed rate. A proof would require understanding the joint distribution of continued-fraction partial quotients and denominators for integer logarithms, including correlations not captured by existing theory.
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.