Construction of Fair Dice Pairs
Open Access
- 17 May 2019
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 7 (5) , 440
Abstract
An interesting and challenging problem in mathematics is how to construct fair dice pairs. In this paper, by means of decomposing polynomials in a residue class ring and applying the Discrete Fourier Transformation, we present all the 2000 fair dice pairs and their 8 equivalence classes in a four-person game, identifying what we call the mandarin duck property of fair dice pairs.Keywords
Funding Information
- National Natural Science Foundation of China (11701118, 11471209)
- Guangdong Provincial Engineering and Technology Research Center ([2015]1487)
- Specialized Fund for Science and Technology Platform and Talent Team Project of Guizhou Province (QianKeHePingTaiRenCai [2016]5609)
- Key Supported Disciplines of Guizhou Province Computer Application Technology (QianXueWeiHeZi ZDXK [2016]20))
This publication has 13 references indexed in Scilit:
- Can You Play a Fair Game of Craps with a Loaded Pair of Dice?The American Mathematical Monthly, 2016
- When Can One Load a Set of Dice so that the Sum Is Uniformly Distributed?Mathematics Magazine, 1999
- Can One Load a Set of Dice So That the Sum Is Uniformly Distributed?Mathematics Magazine, 1997
- A study of a dice problemApplied Mathematics and Computation, 1995
- Dice with Fair SumsThe American Mathematical Monthly, 1988
- Cyclotomic polynomials and nonstandard diceDiscrete Mathematics, 1979
- Renumbering of the Faces of DiceMathematics Magazine, 1979
- Cyclotomic Polynomials and Factorization TheoremsThe American Mathematical Monthly, 1978
- Mathematical GamesScientific American, 1978
- E925The American Mathematical Monthly, 1951