Making a fair roulette from a possibly biased coin

DOI10.1016/0020-0190(90)90072-6MaRDI QIDQ756240zbMATH OpenOpenAlexFDO

Authors Edsger W. Dijkstra

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(90)90072-6

zbMATH Keywords

biased coinroulette

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Review text

This note outlines a method for using a biased coin to simulate an (unbiased) roulette wheel. It contains an interesting application of a theorem of Fermat that, for every prime p and an arbitrary positive integer n, the integer \(n^ p-n\) is divisible by p.

Recommendations

• Simulating fair dice with biased coins
• Blind-friendly von Neumann's heads or tails
• Efficient generation of fair dice with few biased coins
• Achieving Optimal Fairness from Biased Coinflips
• Small collaboration: Modeling phenomena from nature by hyperbolic partial differential equations. Abstracts from the small collaboration held April 11--17, 2021 (hybrid meeting)

Cited in

(6)

• scientific article; zbMATH DE number 1045890 (Why is no real title available?)
• Multihead two-way probabilistic finite automata (extended abstract)
• scientific article; zbMATH DE number 5589306 (Why is no real title available?)
• An efficient method for generating a discrete uniform distribution using a biased random source
• Generating discrete uniform distribution from a biased coin using number-theoretic method
• Multihead two-way probabilistic finite automata

This page was built for publication: Making a fair roulette from a possibly biased coin

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