The powers-of-two conjecture for expected coin-flip ending times
Statement
Let be a finite string of heads and tails, let be its total number of heads and tails, and let denote the expected number of fair-coin flips needed to produce . Assume
Powers-of-two conjecture. The expected value equals possibly plus some lower positive powers of ; asymptotically, is about .
The paper proves this form of behavior for strings with at most four maximal runs or for alternating strings, and the conjecture proposes it for arbitrary ending strings. An intuitive explanation for the resulting sums of powers of remains to be found.
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.