ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a uniformly random Zeckendorf Game on nn initial copies of 11, let MnM_n be the number of moves until the Zeckendorf decomposition of nn is reached, and let E[Mn]\mathbb{E}[M_n] denote its average length. Linear average-length conjecture. The average game length is linear in nn, namely E[Mn]=Θ(n)\mathbb{E}[M_n]=\Theta(n) as nn tends to infinity. The conjecture proposes linear growth for the expected duration of a randomly played game; the supplied text gives no 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.