On the loading of dice (Q1296763)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the loading of dice |
scientific article; zbMATH DE number 1319941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the loading of dice |
scientific article; zbMATH DE number 1319941 |
Statements
On the loading of dice (English)
0 references
6 November 2000
0 references
The starting point of this paper are two naive questions in connection with the forging of ordinary dice, namely ``Is it possible to forge the dice such that the distribution of the sum is uniform on \(2,\dots, 12\)?'' and ``Can there exist properly forged dice such that the distribution of their sum is precisely as in the case of unloaded dice?'' Both problems are treated in the more general context of distributions on \(0, 1,\dots, n\) and \(0,\dots,m\) in relation with the associated convolution on \(0,\dots, n+m\). The numbers \(n\) and \(m\) where forging is possible are completely classified. In this characterization roots of unity, certain polynomials (palindrome polynomials) and unique additive representations of integers by certain prescribed numbers play an important role.
0 references
0.8448442220687866
0 references
0.8016372919082642
0 references
0.786940336227417
0 references