Résumé
A fair coin is flipped n times, and two finite sequences of heads and tails with the same length are given, say A and B. Each time A appears in the sequence of fair coin flips, Alice gets a point, and each time B appears, Bob gets a point. Who is more likely to win? This puzzle is a slight extension of Litt’s game [10]. In this note, we show that the game is fair for any value of n and any two words A, B that have the same auto-correlation structure by building up a bijection that exchanges Bob and Alice scores. It is remarkable that the inter-correlations between A and B do not play any role in this case. Additionally, we propose a conjecture for cases where the game is unfair, providing insights into the underlying structure of the game for a fixed n.
| Titre traduit de la contribution | Sur des cas où le jeu de Litt est équitable |
|---|---|
| langue originale | Anglais |
| Pages (de - à) | 977-984 |
| Nombre de pages | 8 |
| journal | Comptes Rendus Mathematique |
| Volume | 363 |
| Les DOIs | |
| état | Publié - 1 janv. 2025 |
| Modification externe | Oui |
Empreinte digitale
Examiner les sujets de recherche de « Sur des cas où le jeu de Litt est équitable ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver