Failure of Benford behavior for polynomial, exponential, and Fibonacci stopping sequences
Statement
Fix a monotonically increasing sequence . In the additive decomposition process, a stick whose length belongs to does not decompose further; sticks of length also stop decomposing. Non-Benford decomposition conjecture. The process is not Benford if is any of
where is the th Fibonacci number. Together with the positive examples for even and prime stopping sequences, this identifies classes of stopping sequences expected to produce or prevent Benford behavior; the supplied text does not state a proof or resolution.
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.