Longest runs in coin tossing. Teaching recursive formulae, asymptotic theorems and computer simulations

dc.contributor.authorKarácsony, Zsolt
dc.contributor.authorLibor, Józsefné
dc.date.accessioned2024-09-04T09:46:36Z
dc.date.available2024-09-04T09:46:36Z
dc.date.issued2011-12-01
dc.description.abstractThe 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.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 9 No. 2 (2011) , 261-274
dc.identifier.doihttps://doi.org/10.5485/TMCS.2011.0290
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue2
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379709
dc.identifier.volume9
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14899
dc.rights.accessOpen Access
dc.rights.ownerZsolt Karácsony and Józsefné Libor
dc.subjectrunen
dc.subjectrecursive formulaen
dc.subjectasymptotic theoremen
dc.subjectsimulationen
dc.titleLongest runs in coin tossing. Teaching recursive formulae, asymptotic theorems and computer simulationsen
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
457.3 KB
Formátum:
Adobe Portable Document Format