Longest runs in coin tossing. Teaching recursive formulae, asymptotic theorems and computer simulations
Zsolt Karácsony, Józsefné Libor
Source record
Source: Crossref
Published: Dec 1, 2011
DOI: 10.5485/tmcs.2011.0290
Open original source ↗Source abstract
The coin tossing experiment is studied, focusing on higher education. The length of the longest head run can be studied by asymptotic theorems ([3]), by recursive formulae ([10]) or by computer simulations . In this work we make a comparative analysis of recursive formulas, asymptotic results and Monte Carlo simulation for education. We compare the distribution of the longest head run and that of the longest run (i.e. the longest pure heads or pure tails) studying fair coin events. We present a method that helps to understand the concepts and techniques mentioned in the title, which can be a useful didactic tool for colleagues teaching in higher education.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.