Cover Image

How to Answer Questions of the Type: If you toss a coin n times, how likely is HH to show up more than HT?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ekhad, Shalosh B., Zeilberger, Doron
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

How many coin tosses would you need until you get $n$ Heads or $m$ Tails?
by: Janson, Svante, et al.
Published: (2025)

In How Ways Can You Play Stanley Solitaire?
by: Ekhad, Shalosh B., et al.
Published: (2024)

Solving Functional Equations Dear to W.T. Tutte using the Naive (yet fullly rigorous!) Guess And Check Method
by: Ekhad, Shalosh B., et al.
Published: (2024)

Exploring Werner Krandick's Binary Tree Jump Statistics
by: Ekhad, Shalosh B., et al.
Published: (2024)

Efficient Weighted Counting of Multiset Derangements
by: Ekhad, Shalosh B., et al.
Published: (2025)

Experimenting with the Garsia-Milne Involution Principle
by: Ekhad, Shalosh B., et al.
Published: (2025)

The Jackson-Richmond 4CT Constant is EXACTLY 10/27
by: Ekhad, Shalosh B., et al.
Published: (2024)

Efficient Evaluations of Weighted Sums over the Boolean Lattice inspired by conjectures of Berti, Corsi, Maspero, and Ventura
by: Ekhad, Shalosh B., et al.
Published: (2024)

A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
by: Segert, Simon
Published: (2024)

Automated Generation of Generating Functions Related to Generalized Stern's Diatomic Arrays in the footsteps of Richard Stanley
by: Ekhad, Shalosh B., et al.
Published: (2021)

The $O(1/n^{85})$ Asymptotic expansion of OEIS sequence A85
by: Ekhad, Shalosh B., et al.
Published: (2024)

Explicit Expressions for the First 20 Moments of the Area Under Dyck and Motzkin Paths
by: Bu, AJ, et al.
Published: (2024)

Every Fifth Real Number is Evil
by: Zeilberger, Doron
Published: (2025)

The generalized Alice HH vs Bob HT problem
by: Janson, Svante, et al.
Published: (2025)

On maximizing the number of heads when you need to set aside at least one coin every round
by: van Doorn, Wouter
Published: (2024)

A Short Proof that the number of $(a,b)$-parking functions of length n $a(a+bn)^{n-1}$
by: Bu, AJ, et al.
Published: (2024)

A combinatorial proof of Cramer's Rule
by: Zeilberger, Doron
Published: (2024)

Lots and Lots of Perrin-Type Primality Tests and Their Pseudo-Primes
by: Dougherty-Bliss, Robert, et al.
Published: (2023)

Hitting k primes by dice rolls
by: Alon, Noga, et al.
Published: (2025)

Self-avoiding walk is ballistic on graphs with more than one end
by: Lehner, Florian, et al.
Published: (2024)

Proofs Of Three Geode Conjectures
by: Amdeberhan, Tewodros, et al.
Published: (2025)

Counting (and Randomly Generating) Hamiltonian Cycles in Rectangular Grids
by: Blanco, Pablo, et al.
Published: (2026)

Bijective and Automated Approaches to Abel Sums
by: Kalai, Gil, et al.
Published: (2024)

Enumerating Seating Arrangements that Obey Social Distancing
by: Spahn, George, et al.
Published: (2024)

Moments for generalizations of a coin flip game
by: Huang, Jia
Published: (2026)

The Challenge of Computing Geode Numbers
by: Amdeberhan, Tewodros, et al.
Published: (2025)

Cutting 4 by $n$ grids into two congruent pieces
by: Dougherty-Bliss, Robert, et al.
Published: (2025)

Probabilistic $(m,n)$-Parking Functions
by: Harris, Pamela E., et al.
Published: (2025)

Tight Asymptotic of Probability of singularity of n x n Random Matrix with Uniform Distributed \pm 1 Entries
by: Blinovsky, Vladimir
Published: (2015)

Statistical Analysis of Hairpins and BasePairs in RNA Secondary Structures
by: Bu, AJ, et al.
Published: (2026)

Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs $G(n,m)$ and $G(n,p)$
by: Alvarado, José D., et al.
Published: (2023)

Asymptotics of the partial $n$-fold dimer model
by: Meng, Christina
Published: (2024)

Automated Counting of Spanning Trees for Several Infinite Families of Graphs
by: Blanco, Pablo, et al.
Published: (2025)

Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
by: Balister, Paul, et al.
Published: (2022)

Moderate Deviations of Triangle Counts in the Erdős-Rényi Random Graph $G(n,m)$: The Lower Tail
by: Alvarado, José, et al.
Published: (2024)

Hitting times in the binomial random graph
by: Granet, Bertille, et al.
Published: (2024)

Hitting time of connectedness in the random hypercube process
by: Diskin, Sahar, et al.
Published: (2024)

Mixing time and isoperimetry in random geometric graphs
by: Kiwi, Marcos, et al.
Published: (2025)

Repeated Block Averages: entropic time and mixing profiles
by: Caputo, Pietro, et al.
Published: (2024)

Meeting, coalescence and consensus time on random directed graphs
by: Avena, Luca, et al.
Published: (2023)