ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider an additive decomposition process starting from a stick of integer length LL: choose uniformly an integer cut point c∈[1,L−1]c\in[1,L-1], replace the stick by pieces of lengths cc and L−cL-c, and continue recursively. A piece stops decomposing when its length is 11 or belongs to a prescribed sequence {an}\{a_n\}. Benford behavior conjecture. The resulting stick lengths follow Benford's Law for many choices of {an}\{a_n\}; in particular, this holds when either

{an}={2n}\{a_n\}=\{2n\}

or {an}\{a_n\} is the set of all prime numbers. This proposes Benford behavior for discrete additive decomposition processes stopped at even lengths or prime lengths, supported in the paper by numerical evidence and by analogy with the continuous model.

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.