{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[15,2,15,3],[16,2,16,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910452383003321"]
[null,null,"Autore",null,"Nahin Paul J."]
[null,null,"Titolo",null,"Digital Dice : Computational Solutions to Practical Probability Problems / / Paul J. Nahin"]
[null,null,"Pubbl/distr/stampa",null,"Princeton, NJ : , : Princeton University Press, , [2013]"]
[{"$nulls":4},"©2013"]
[null,null,"ISBN",null,"1-4008-4611-0"]
[{"$nulls":4},"1-299-13927-2"]
[null,null,"Edizione",null,"[With a New preface by the author]"]
[null,null,"Descrizione fisica",null,"1 online resource (289 p.)"]
[null,null,"Collana",null,"Princeton Puzzlers"]
[null,null,"Disciplina",null,"519.2076"]
[null,null,"Soggetti",null,"Mathematics"]
[{"$nulls":4},"Physical Sciences & Mathematics"]
[{"$nulls":4},"Mathematical Statistics"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Frontmatter -- Contents -- Preface to the Paperback Edition -- ntroduction -- 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 -- 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 -- The Solutions -- 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 -- 14. Parrondo's Paradox -- 15. How Long Is theWait to Get the Potato Salad? -- 16. The Appeals Court "]
[{"$nulls":4},"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 Series -- 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. Author-Created MATLAB m-files and Their Location in the Book -- Glossary -- Acknowledgments -- Index -- Also by Paul J. Nahin"]
[null,null,null,"Sommario/riassunto","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 odds of coin-flipping games to figuring out the behavior of elevators. Problems build from relatively easy (deciding whether a dishwasher who breaks most of the dishes at a restaurant during a given week is clumsy or just the victim of randomness) to the very difficult (tackling branching processes of the kind that had to be solved by Manhattan Project mathematician Stanislaw Ulam). In his characteristic style, Nahin brings the problems to life with interesting and odd historical anecdotes. Readers learn, for example, not just how to determine the optimal stopping point in any selection process but that astronomer Johannes Kepler selected his second wife by interviewing eleven women. The book shows readers how to write elementary computer codes using any common programming language, and provides solutions and line-by-line walk-throughs of a MATLAB code for each problem. Digital Dice will appeal to anyone who enjoys popular math or computer science. In a new preface, Nahin wittily addresses some of the responses he received to the first edition."]