Benford behavior for additive decompositions stopped at evens or primes
Statement
Consider an additive decomposition process starting from a stick of integer length : choose uniformly an integer cut point , replace the stick by pieces of lengths and , and continue recursively. A piece stops decomposing when its length is or belongs to a prescribed sequence . Benford behavior conjecture. The resulting stick lengths follow Benford's Law for many choices of ; in particular, this holds when either
or 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
- Source
- Thealexa Becker, David Burt, Taylor C. Corcoran, Alec Greaves-Tunnell, Joseph R. Iafrate, Joy Jing, Steven J. Miller, Jaclyn D. Porfilio, Ryan Ronan, Jirapat Samranvedhya, Frederick W. Strauch and Blaine Talbut, “Benford's Law and Continuous Dependent Random Variables”, arXiv:1309.5603 (2018).
- MathDB
- Added
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.