Longest runs in coin tossing. Comparison of recursive formulae, asymptotic theorems, computer simulations
István Fazekas, Zsuzsa Libor · University of Debrecen Electronic Archive (University of Debrecen) · 2010
The coin tossing experiment is studied. The length of the longest head run can be studied by asymptotic theorems (3, 4), by recursive formulae (7, 11) or by computer simulations (1). The aim of the paper is to compare numerically the asymptotic results, the recursive formulae, and the simulation results. Moreover, we consider also the longest run (i.e. the longest pure heads or pure tails). We compare the distribution of the longest head run and that of the longest run.