Digital dice computational solutions to practical probability problems

Some probability problems are so difficult that they stump the smartest mathematicians. But even the hardest of these problems can often be solved with a computer and a Monte Carlo simulation, in which a random-number generator simulates a physical process, such as a million rolls of a pair of dice....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Nahin, Paul J
Format:	E-Book Buch
Sprache:	Englisch
Veröffentlicht:	Princeton Princeton University Press 2013
Ausgabe:	1
Schriftenreihe:	Princeton Puzzlers
Schlagworte:	Addition Algorithm Algorithms Almost surely Ballot Bus Calculation College of Cardinals Computer programming Computer scientist COMPUTERS / Mathematical & Statistical Software Conviction Customer Data processing Deliberation Desk Dishwasher Elaboration Error Estimation Expected value Exponential distribution Fair coin Floor and ceiling functions Flowchart Geometric probability Histogram Imperial election Inclusion–exclusion principle Integer Location (geography) Mathematician MATHEMATICS MATHEMATICS / Probability & Statistics / General MATHEMATICS / Recreations & Games MathWorks MATLAB Medicine man Monte Carlo method Nuclear fission product Nuclear weapon Percentage Petitioner Police car Polynomial Probabilities Probability Probability density function Probability theory Problem statement Problems, exercises, etc Pure mathematics Quantity Random number Random number generation Random permutation Random variable Result Sample Size Sample space Sampling (statistics) Server (computing) Simulation Sorting algorithm Special case Stanislaw Ulam Statistics Stochastic process Subroutine Summation Technology Textbook Traffic light Umbrella Uranium-235 Variable (computer science) Variance reduction Voting While loop Polynomial Histogram Exponential distribution Floor and ceiling functions Customer Stanislaw Ulam MathWorks Inclusion–exclusion principle Stochastic process MATLAB Result Sorting algorithm Sampling (statistics) Variable (computer science) Probability density function Umbrella Conviction Desk Calculation Location (geography) Random variable Fair coin Monte Carlo method Addition Estimation Dishwasher Almost surely Algorithm Deliberation Expected value Sample Size Random permutation Geometric probability Problem statement Textbook Special case Summation Subroutine Mathematics Random number Nuclear weapon Imperial election Voting Pure mathematics Computer scientist Medicine man Petitioner While loop Sample space Random number generation Elaboration Bus Computer programming Uranium-235 Percentage Probability theory Probability College of Cardinals Quantity Error Police car Mathematician Flowchart Ballot Nuclear fission product Integer Simulation Variance reduction Traffic light Server (computing)
ISBN:	9780691126982, 0691158215, 0691126984, 9780691158211, 9781400846115, 1400846110
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Some probability problems are so difficult that they stump the smartest mathematicians. But even the hardest of these problems can often be solved with a computer and a Monte Carlo simulation, in which a random-number generator simulates a physical process, such as a million rolls of a pair of dice. This is what Digital Dice is all about: how to get numerical answers to difficult probability problems without having to solve complicated mathematical equations.
Bibliographie:	"Second printing, and first paperback printing, with a new preface by the author, 2013"--T.p. verso Includes index
ISBN:	9780691126982 0691158215 0691126984 9780691158211 9781400846115 1400846110
DOI:	10.1515/9781400846115