Abstract
Moser asks how a pair of (n+1)-sided dice should be loaded (identically) so that on throwing the dice the frequency of the most frequently occurring sum is as small as possible. G. F. Clements finds a relative minimum, conjecturing that it is always the solution. This conjecture is disproved for n=3.
Original language | English |
---|---|
Pages (from-to) | 298-300 |
Number of pages | 3 |
Journal | Journal of Combinatorial Theory |
Volume | 6 |
Issue number | 3 |
DOIs | |
State | Published - Apr 1969 |