Finding the “Best” n-die when Fixing the Sum
| dc.contributor.advisor | Shen, Jian | |
| dc.contributor.author | Contreras, Norman | |
| dc.contributor.committeeMember | Rusnak, Lucas | |
| dc.contributor.committeeMember | Curtin, Eugene | |
| dc.date.accessioned | 2021-11-24T19:56:49Z | |
| dc.date.available | 2021-11-24T19:56:49Z | |
| dc.date.issued | 2021-12 | |
| dc.description.abstract | This paper discusses results found by systematically listing every possible 6-sided die with a fixed sum of 21 and running a round-robin tournament to find the “best” die. | |
| dc.description.department | Mathematics | |
| dc.format | Text | |
| dc.format.extent | 27 pages | |
| dc.format.medium | 1 file (.pdf) | |
| dc.identifier.citation | Contreras, N. (2021). <i>Finding the “best” n-die when fixing the sum</i> (Unpublished thesis). Texas State University, San Marcos, Texas. | |
| dc.identifier.uri | https://hdl.handle.net/10877/14946 | |
| dc.language.iso | en | |
| dc.subject | Dice | |
| dc.subject | Combinatorics | |
| dc.title | Finding the “Best” n-die when Fixing the Sum | |
| dc.type | Thesis | |
| thesis.degree.department | Mathematics | |
| thesis.degree.discipline | Mathematics | |
| thesis.degree.grantor | Texas State University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- CONTRERAS-THESIS-2021.pdf
- Size:
- 232.56 KB
- Format:
- Adobe Portable Document Format