The reversal symmetry conjecture for expected coin-flip ending times
Statement
Let be a finite ending string of heads and tails, let be its reversal, and let denote the expected number of fair-coin flips needed to produce . Thus, if , then .
Reversal symmetry conjecture. If is the reversal of an ending string , then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.