ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a finite ending string of heads and tails, let S′S' be its reversal, and let E(S)E(S) denote the expected number of fair-coin flips needed to produce SS. Thus, if S=s1s2⋯srS=s_1s_2\cdots s_r, then S′=srsr−1⋯s1S'=s_rs_{r-1}\cdots s_1.

Reversal symmetry conjecture. If S′S' is the reversal of an ending string SS, then

E(S)=E(S′).E(S)=E(S').

The paper establishes this symmetry for ending strings with two, three, and four alternating runs through the cited preceding theorems. The conjecture extends that observed symmetry to arbitrary ending strings.

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.