The MichelangeRoll expected-toss lower-bound conjecture
Statement
Let be the number of possible outcomes in a uniform sample, and consider the bulleted procedure at the beginning of the subsection that generates tosses from this sample. Conditioning on , let the expected number of generated tosses be denoted by . Expected-toss lower-bound conjecture. The expected number of tosses generated by the procedure satisfies
The preceding discussion reports numerical evidence that this bound holds and that the constant is asymptotically tight. The conjecture was subsequently proved by an argument of Knuth and Yao used for the corresponding “” penalty.
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.