Linear average-length conjecture for the Zeckendorf Game
Statement
For a uniformly random Zeckendorf Game on initial copies of , let be the number of moves until the Zeckendorf decomposition of is reached, and let denote its average length. Linear average-length conjecture. The average game length is linear in , namely as 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.