ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN 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 NN, let the expected number of generated tosses be denoted by T(N)\mathcal T(N). Expected-toss lower-bound conjecture. The expected number of tosses generated by the procedure satisfies

T(N)⩾log⁡2(N)−2.\mathcal T(N)\geqslant \log_2(N)-2.

The preceding discussion reports numerical evidence that this bound holds and that the constant −2-2 is asymptotically tight. The conjecture was subsequently proved by an argument of Knuth and Yao used for the corresponding “+2+2” 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 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.