Note on a Coin Tossing Problem Posed by Daniel Litt

2024/09/19 by Bruce Levin, Levin, Bruce · 1 citation
Mathematics · #60C05 #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Mathematical Dynamics and Fractals

paper · pdf · doi:10.48550/arxiv.2409.13087

openalex publication_date 2024/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present an analysis of a coin-tossing problem posed by Daniel Litt which has generated some popular interest. We demonstrate a recursive identity which leads to relatively simple formulas for the excess number of wins for one player over the other together with its increments as the number of coin tosses increases. Formulas and recursive algorithms are provided to calculate the number of sequences with any given point-score difference.

Cited by

• Proof of a combinatorial conjecture posed in "The Blimpy Shape of Heady-s and Taily-s Bit Strings"

Related

• On cases where Litt's game is fair
• How to Answer Questions of the Type: If you toss a coin n times, how likely is HH to show up more than HT?
• A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
• Playing Several Patterns Against One Another
• A game-theoretic proof of Erdos-Feller-Kolmogorov-Petrowsky law of the iterated logarithm for fair-coin tossing