An open toss problem

DOI10.1155/S0161171293000778MaRDI QIDQ687884zbMATH OpenOpenAlexFDO

Authors Prem N. Bajaj, G. R. Mendieta

Publication date 17 February 1994

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46906

zbMATH Keywords

coin tossingdepletion model

Mathematics Subject Classification ID

Combinatorial probability (60C05) Applications of statistics (62P99)

Review text

Summary: We discuss some particular cases of the following problem. Each of \(m\) persons tosses a coin. Those who get heads stay for the next round. Those who get tails are eliminated; however, if all persons get tails in a round, they move to the next round (as if each of them had got a head). The problem is to find the possibility that exactly one person is left after \(r\) rounds. All coins are considered identical but not necessarily fair.

Recommendations

• A Coin-Tossing Problem and Some Related Combinatorics
• scientific article; zbMATH DE number 4184524
• A Probability of More Heads
• Aremheads better than two?
• How to select a loser

Cited in

(4)

• Heads up: no teamwork required
• A Coin-Tossing Problem and Some Related Combinatorics
• scientific article; zbMATH DE number 701413 (Why is no real title available?)
• From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader

This page was built for publication: An open toss problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687884)