Digital Dice: Computational Solutions to Practical Probability Problems
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Princeton, N.J.
Princeton University Press
2013
|
| Schriftenreihe: | Princeton Puzzlers
|
| Schlagworte: | |
| Online-Zugang: | FAB01 FAW01 FCO01 FHA01 FKE01 FLA01 UPA01 Volltext Volltext |
| Beschreibung: | Biographical note: NahinPaul J.: Paul J. Nahin is the author of many best-selling popular-math books, including "Chases and Escapes", "Dr. Euler's Fabulous Formula", "When Least is Best", "Duelling Idiots and Other Probability Puzzlers", and "An Imaginary Tale" (all Princeton). He is professor emeritus of electrical engineering at the University of New Hampshire Main description: 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 |
| Beschreibung: | 1 Online-Ressource (288 S.) |
| ISBN: | 9781400846115 |
| DOI: | 10.1515/9781400846115 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042523089 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150423s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9781400846115 |9 978-1-4008-4611-5 | ||
| 024 | 7 | |a 10.1515/9781400846115 |2 doi | |
| 035 | |a (OCoLC)847124813 | ||
| 035 | |a (DE-599)BVBBV042523089 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-859 |a DE-860 |a DE-Aug4 |a DE-739 |a DE-1046 |a DE-1043 |a DE-858 | ||
| 082 | 0 | |a 519.2076 | |
| 100 | 1 | |a Nahin, Paul J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Digital Dice |b Computational Solutions to Practical Probability Problems |
| 264 | 1 | |a Princeton, N.J. |b Princeton University Press |c 2013 | |
| 300 | |a 1 Online-Ressource (288 S.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Princeton Puzzlers | |
| 500 | |a Biographical note: NahinPaul J.: Paul J. Nahin is the author of many best-selling popular-math books, including "Chases and Escapes", "Dr. Euler's Fabulous Formula", "When Least is Best", "Duelling Idiots and Other Probability Puzzlers", and "An Imaginary Tale" (all Princeton). He is professor emeritus of electrical engineering at the University of New Hampshire | ||
| 500 | |a Main description: 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 | ||
| 650 | 0 | 7 | |a Wahrscheinlichkeitsrechnung |0 (DE-588)4064324-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computermathematik |0 (DE-588)4788218-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Wahrscheinlichkeitsrechnung |0 (DE-588)4064324-4 |D s |
| 689 | 0 | 1 | |a Computermathematik |0 (DE-588)4788218-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9781400846115 |x Verlag |3 Volltext |
| 856 | 4 | 0 | |u http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400846115&searchTitles=true |x Verlag |3 Volltext |
| 912 | |a ZDB-23-DGG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027957428 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1515/9781400846115?locatt=mode:legacy |l FAB01 |p ZDB-23-DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400846115?locatt=mode:legacy |l FAW01 |p ZDB-23-DGG |q FAW_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400846115?locatt=mode:legacy |l FCO01 |p ZDB-23-DGG |q FCO_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400846115?locatt=mode:legacy |l FHA01 |p ZDB-23-DGG |q FHA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400846115?locatt=mode:legacy |l FKE01 |p ZDB-23-DGG |q FKE_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400846115?locatt=mode:legacy |l FLA01 |p ZDB-23-DGG |q FLA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9781400846115?locatt=mode:legacy |l UPA01 |p ZDB-23-DGG |q UPA_PDA_DGG |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804153276536455168 |
|---|---|
| any_adam_object | |
| author | Nahin, Paul J. |
| author_facet | Nahin, Paul J. |
| author_role | aut |
| author_sort | Nahin, Paul J. |
| author_variant | p j n pj pjn |
| building | Verbundindex |
| bvnumber | BV042523089 |
| collection | ZDB-23-DGG |
| ctrlnum | (OCoLC)847124813 (DE-599)BVBBV042523089 |
| dewey-full | 519.2076 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.2076 |
| dewey-search | 519.2076 |
| dewey-sort | 3519.2076 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1515/9781400846115 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04423nmm a2200505zc 4500</leader><controlfield tag="001">BV042523089</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150423s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400846115</subfield><subfield code="9">978-1-4008-4611-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400846115</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)847124813</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042523089</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-1043</subfield><subfield code="a">DE-858</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.2076</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nahin, Paul J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Digital Dice</subfield><subfield code="b">Computational Solutions to Practical Probability Problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, N.J.</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (288 S.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Puzzlers</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Biographical note: NahinPaul J.: Paul J. Nahin is the author of many best-selling popular-math books, including "Chases and Escapes", "Dr. Euler's Fabulous Formula", "When Least is Best", "Duelling Idiots and Other Probability Puzzlers", and "An Imaginary Tale" (all Princeton). He is professor emeritus of electrical engineering at the University of New Hampshire</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Main description: 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</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wahrscheinlichkeitsrechnung</subfield><subfield code="0">(DE-588)4064324-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computermathematik</subfield><subfield code="0">(DE-588)4788218-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Wahrscheinlichkeitsrechnung</subfield><subfield code="0">(DE-588)4064324-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Computermathematik</subfield><subfield code="0">(DE-588)4788218-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400846115</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400846115&searchTitles=true</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027957428</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400846115?locatt=mode:legacy</subfield><subfield code="l">FAB01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400846115?locatt=mode:legacy</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAW_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400846115?locatt=mode:legacy</subfield><subfield code="l">FCO01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FCO_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400846115?locatt=mode:legacy</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FHA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400846115?locatt=mode:legacy</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FKE_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400846115?locatt=mode:legacy</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FLA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9781400846115?locatt=mode:legacy</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UPA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV042523089 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:24:02Z |
| institution | BVB |
| isbn | 9781400846115 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027957428 |
| oclc_num | 847124813 |
| open_access_boolean | |
| owner | DE-859 DE-860 DE-Aug4 DE-739 DE-1046 DE-1043 DE-858 |
| owner_facet | DE-859 DE-860 DE-Aug4 DE-739 DE-1046 DE-1043 DE-858 |
| physical | 1 Online-Ressource (288 S.) |
| psigel | ZDB-23-DGG ZDB-23-DGG FAW_PDA_DGG ZDB-23-DGG FCO_PDA_DGG ZDB-23-DGG FHA_PDA_DGG ZDB-23-DGG FKE_PDA_DGG ZDB-23-DGG FLA_PDA_DGG ZDB-23-DGG UPA_PDA_DGG |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Princeton University Press |
| record_format | marc |
| series2 | Princeton Puzzlers |
| spelling | Nahin, Paul J. Verfasser aut Digital Dice Computational Solutions to Practical Probability Problems Princeton, N.J. Princeton University Press 2013 1 Online-Ressource (288 S.) txt rdacontent c rdamedia cr rdacarrier Princeton Puzzlers Biographical note: NahinPaul J.: Paul J. Nahin is the author of many best-selling popular-math books, including "Chases and Escapes", "Dr. Euler's Fabulous Formula", "When Least is Best", "Duelling Idiots and Other Probability Puzzlers", and "An Imaginary Tale" (all Princeton). He is professor emeritus of electrical engineering at the University of New Hampshire Main description: 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 Wahrscheinlichkeitsrechnung (DE-588)4064324-4 gnd rswk-swf Computermathematik (DE-588)4788218-9 gnd rswk-swf Wahrscheinlichkeitsrechnung (DE-588)4064324-4 s Computermathematik (DE-588)4788218-9 s 1\p DE-604 https://doi.org/10.1515/9781400846115 Verlag Volltext http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400846115&searchTitles=true Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Nahin, Paul J. Digital Dice Computational Solutions to Practical Probability Problems Wahrscheinlichkeitsrechnung (DE-588)4064324-4 gnd Computermathematik (DE-588)4788218-9 gnd |
| subject_GND | (DE-588)4064324-4 (DE-588)4788218-9 |
| title | Digital Dice Computational Solutions to Practical Probability Problems |
| title_auth | Digital Dice Computational Solutions to Practical Probability Problems |
| title_exact_search | Digital Dice Computational Solutions to Practical Probability Problems |
| title_full | Digital Dice Computational Solutions to Practical Probability Problems |
| title_fullStr | Digital Dice Computational Solutions to Practical Probability Problems |
| title_full_unstemmed | Digital Dice Computational Solutions to Practical Probability Problems |
| title_short | Digital Dice |
| title_sort | digital dice computational solutions to practical probability problems |
| title_sub | Computational Solutions to Practical Probability Problems |
| topic | Wahrscheinlichkeitsrechnung (DE-588)4064324-4 gnd Computermathematik (DE-588)4788218-9 gnd |
| topic_facet | Wahrscheinlichkeitsrechnung Computermathematik |
| url | https://doi.org/10.1515/9781400846115 http://www.degruyter.com/search?f_0=isbnissn&q_0=9781400846115&searchTitles=true |
| work_keys_str_mv | AT nahinpaulj digitaldicecomputationalsolutionstopracticalprobabilityproblems |