Construction of Fair Dice Pairs
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-pe...
Main Authors: | Yong Huang, Zhenbing Zeng, Yongsheng Rao, Yu Zou, Ying Wang, Xing Huang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-05-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/7/5/440 |
Similar Items
-
Cluster-Based Thermodynamics of Interacting Dice in a Lattice
by: Christoph Mayer, et al.
Published: (2020-10-01) -
Efficient and Secure Outsourcing of DFT, IDFT, and Circular Convolution
by: Xiangli Xiao, et al.
Published: (2019-01-01) -
nnAudio: An on-the-Fly GPU Audio to Spectrogram Conversion Toolbox Using 1D Convolutional Neural Networks
by: Kin Wai Cheuk, et al.
Published: (2020-01-01) -
Construction of Weakly Self-Dual Normal Bases and Its Aplication in Orthogonal Transform Encoding Cyclic Codes
by: Irwansyah, et al.
Published: (2014-03-01) -
VLSI Architecture for Novel Hopping Discrete Fourier Transform Computation
by: Wen-Ho Juang, et al.
Published: (2018-01-01)