Note on a Coin Tossing Problem Posed by Daniel Litt
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914183364214784 |
|---|---|
| author | Levin, Bruce |
| author_facet | Levin, Bruce |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_13087 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Note on a Coin Tossing Problem Posed by Daniel Litt Levin, Bruce Combinatorics 60C05 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. |
| title | Note on a Coin Tossing Problem Posed by Daniel Litt |
| topic | Combinatorics 60C05 |
| url | https://arxiv.org/abs/2409.13087 |