Show simple item record

dc.contributor.advisorShen, Jian
dc.contributor.authorContreras, Norman ( Orcid Icon 0000-0001-6432-7684 )
dc.date.accessioned2021-11-24T19:56:49Z
dc.date.available2021-11-24T19:56:49Z
dc.date.issued2021-12
dc.identifier.citationContreras, N. (2021). Finding the “best” n-die when fixing the sum (Unpublished thesis). Texas State University, San Marcos, Texas.
dc.identifier.urihttps://digital.library.txstate.edu/handle/10877/14946
dc.description.abstractThis 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.formatText
dc.format.extent27 pages
dc.format.medium1 file (.pdf)
dc.language.isoen
dc.subjectDice
dc.subjectCombinatorics
dc.titleFinding the “Best” n-die when Fixing the Sum
txstate.documenttypeThesis
dc.contributor.committeeMemberRusnak, Lucas
dc.contributor.committeeMemberCurtin, Eugene
thesis.degree.departmentMathematics
thesis.degree.disciplineMathematics
thesis.degree.grantorTexas State University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science
dc.description.departmentMathematics


Download

Thumbnail

This item appears in the following Collection(s)

Show simple item record