ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix a monotonically increasing sequence {an}\{a_n\}. In the additive decomposition process, a stick whose length belongs to {an}\{a_n\} does not decompose further; sticks of length 11 also stop decomposing. Non-Benford decomposition conjecture. The process is not Benford if {an}\{a_n\} is any of

{n2},{2n},{Fn},\{n^2\},\qquad \{2^n\},\qquad \{F_n\},

where FnF_n is the nnth 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

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.