Cargando…
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....
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton, N.J. ; Oxford :
Princeton University Press,
©2013.
|
| Edición: | [Pbk. ed.]. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn832618068 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130327s2013 njua ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d DEBSZ |d JSTOR |d OCLCO |d OCLCQ |d OCLCO |d OCLCF |d OCLCQ |d OCLCO |d MERUC |d ZCU |d IOG |d EZ9 |d ICG |d TXC |d OCLCO |d AU@ |d OCLCO |d OCLCQ |d OCLCO |d LVT |d DKC |d OCLCQ |d HS0 |d OCLCO |d OCL |d OCLCQ |d VRC |d FUT |d OCLCO |d OCLCL |d OCLCQ | ||
| 020 | |a 9781400846115 |q (electronic bk.) | ||
| 020 | |a 1400846110 |q (electronic bk.) | ||
| 020 | |z 9780691126982 | ||
| 020 | |z 0691126984 | ||
| 029 | 1 | |a AU@ |b 000055882673 | |
| 029 | 1 | |a DEBBG |b BV044171782 | |
| 029 | 1 | |a DEBSZ |b 382944364 | |
| 029 | 1 | |a GBVCP |b 1003727379 | |
| 029 | 1 | |a AU@ |b 000070013578 | |
| 035 | |a (OCoLC)832618068 | ||
| 037 | |a 22573/ctt20r9z8 |b JSTOR | ||
| 050 | 4 | |a QA273.25 |b .N34 2013eb | |
| 072 | 7 | |a MAT |x 029000 |2 bisacsh | |
| 072 | 7 | |a MAT025000 |2 bisacsh | |
| 072 | 7 | |a MAT029000 |2 bisacsh | |
| 072 | 7 | |a COM077000 |2 bisacsh | |
| 082 | 0 | 4 | |a 519.2076 |2 22 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Nahin, Paul J. | |
| 245 | 1 | 0 | |a Digital dice : |b computational solutions to practical probability problems / |c Paul J. Nahin. |
| 250 | |a [Pbk. ed.]. | ||
| 260 | |a Princeton, N.J. ; |a Oxford : |b Princeton University Press, |c ©2013. | ||
| 300 | |a 1 online resource (xi, 263 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file |2 rda | ||
| 504 | |a Includes bibliographical references and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Cover; Title; Copyright; Dedication; Comments on Probability and Monte Carlo; Contents; Preface to the Paperback Edition; Introduction; The Problems; 1. The Clumsy Dishwasher Problem; 2. Will Lil and Bill Meet at the Malt Shop?; 3. A Parallel Parking Question; 4. A Curious Coin-Flipping Game; 5. The Gamow-Stern Elevator Puzzle; 6. Steve's Elevator Problem; 7. The Pipe Smoker's Discovery; 8. A Toilet Paper Dilemma; 9. The Forgetful Burglar Problem; 10. The Umbrella Quandary; 11. The Case of the Missing Senators; 12. How Many Runners in a Marathon?; 13. A Police Patrol Problem | |
| 505 | 8 | |a 14. Parrondo's Paradox 15. How Long Is the Wait to Get the Potato Salad?; 16. The Appeals Court Paradox; 17. Waiting for Buses; 18. Waiting for Stoplights; 19. Electing Emperors and Popes; 20. An Optimal Stopping Problem; 21. Chain Reactions, Branching Processes, and Baby Boys; MATLAB Solutions To The Problems; 1. The Clumsy Dishwasher Problem; 2. Will Lil and Bill Meet at the Malt Shop?; 3. A Parallel Parking Question; 4. A Curious Coin-Flipping Game; 5. The Gamow-Stern Elevator Puzzle; 6. Steve's Elevator Problem; 7. The Pipe Smoker's Discovery; 8. A Toilet Paper Dilemma | |
| 505 | 8 | |a 9. The Forgetful Burglar Problem 10. The Umbrella Quandary; 11. The Case of the Missing Senators; 12. How Many Runners in a Marathon?; 13. A Police Patrol Problem; 14. Parrondo's Paradox; 15. How Long is the Wait to Get the Potato Salad?; 16. The Appeals Court Paradox; 17. Waiting for Buses; 18. Waiting for Stoplights; 19. Electing Emperors and Popes; 20. An Optimal Stopping Problem; 21. Chain Reactions, Branching Processes, and Baby Boys; Appendix 1. One Way to Guess on a Test; Appendix 2. An Example of Variance-Reduction in the Monte Carlo Method; Appendix 3. Random Harmonic Sums | |
| 505 | 8 | |a Appendix 4. Solving Montmort's Problem by Recursion Appendix 5. An Illustration of the Inclusion-Exclusion Principle; Appendix 6. Solutions to the Spin Game; Appendix 7. How to Simulate Kelvin's Fair Coin with a Biased Coin; Appendix 8. How to Simulate an Exponential Random Variable; Appendix 9. Index to Author-Created MATLAB m-Files in the Book; Glossary; Acknowledgments; Index; Also by Paul J. Nahin | |
| 520 | |a 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. Popular-math writer Paul Nahin challenges readers to solve twenty-one difficult but fun problems, from determining the. | ||
| 590 | |a JSTOR |b Books at JSTOR Demand Driven Acquisitions (DDA) | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 630 | 0 | 0 | |a MATLAB. |
| 630 | 0 | 7 | |a MATLAB |2 fast |
| 650 | 0 | |a Probabilities |v Problems, exercises, etc. | |
| 650 | 0 | |a Probabilities |x Data processing. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 6 | |a Probabilités |v Problèmes et exercices. | |
| 650 | 6 | |a Probabilités |x Informatique. | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a MATHEMATICS |x Probability & Statistics |x General. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Recreations & Games. |2 bisacsh | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Probabilities |2 fast | |
| 650 | 7 | |a Probabilities |x Data processing |2 fast | |
| 650 | 7 | |a Computermathematik |2 gnd | |
| 650 | 7 | |a Wahrscheinlichkeitsrechnung |2 gnd | |
| 650 | 7 | |a Mathematics. |2 hilcc | |
| 650 | 7 | |a Physical Sciences & Mathematics. |2 hilcc | |
| 650 | 7 | |a Mathematical Statistics. |2 hilcc | |
| 655 | 7 | |a Problems and exercises |2 fast | |
| 758 | |i has work: |a Digital dice (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFX46PjQfBVPG36QCyQj83 |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Nahin, Paul J. |t Digital dice. |d Princeton, N.J. ; Oxford : Princeton University Press, ©2013 |z 9780691158211 |w (DLC) 2012954924 |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1105925 |z Texto completo |
| 938 | |a EBSCOhost |b EBSC |n 517043 | ||
| 994 | |a 92 |b IZTAP | ||