Authors: Gary J. Duggan
A simple coin toss game, attributed to Nicolaus Bernoulli in the early 1700s, results in a mathematical paradox which still appears to be subject to what might be described as "conceptual" rather than "mathematical" solutions. A mathematical solution is given showing that, if the number of games is 2^m-1 then the average payout per game for this number of games is m/(2-(1/2^(m-1))).
Comments: 5 Pages.
Download: PDF
[v1] 2022-02-13 23:14:57
Unique-IP document downloads: 252 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.