Vi has completed her board game! Her game requires a way to pick an integer from 1 to 60 with equal probability using dice. The following is how to choose and number the dice:
However, the dice numbering Aisling gave is not optimal. She wants to find a dice numbering that minimises the total number of faces of the dice used. What is the minimum number of faces required?
For instance, rolling a 6-sided die and an 8-sided die together numbered gives an equal probability of totaling an integer between to . And the total number of faces used is .
This problem is a continuation of this problem
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Suppose that K dice are used, with sides N 1 , N 2 , … , N K . If the probability generating function of the j th dice is G j ( t ) , then G j ( t ) = N j 1 P j ( t ) where P j ( t ) is a polynomial with nonnegative integer coefficients such that P j ( 1 ) = N j for each j . In addition we must have j = 1 ∏ K G j ( t ) = 6 0 1 j = 1 ∑ 6 0 t j so that the sum of the throws of all the dice gives a uniform distribution on { 1 , 2 , 3 , … , 6 0 } . Thus 6 0 P 1 ( t ) P 2 ( t ) ⋯ P K ( t ) = N 1 N 2 ⋯ N k ( t + t 2 + ⋯ + t 6 0 ) and so t must divide one of the polynomials P j ( t ) ,. Without loss of generality we assume that P 1 ( t ) = t P ^ 1 ( t ) for some polynomial P ^ 1 ( t ) , and hence 6 0 P ^ 1 ( t ) P 2 ( t ) ⋯ P K ( t ) 6 0 P ^ 1 ( 0 ) P 2 ( 0 ) ⋯ P K ( 0 ) = N 1 N 2 ⋯ N k ( 1 + t + t 2 + ⋯ t 5 9 ) = N 1 N 2 ⋯ N k and so at least one of N 1 , N 2 , … , N K must be divisible by 3 , and at least one must be divisible by 5 . Thus one of the dice must be a 2 0 -gon, and one of the other dice must be either a 6 -gon or a 1 2 -gon.
Thus the least possible number of faces used will be 2 6 if we can achieve what we want using just a 6 -gon and a 2 0 -gon. But since ( t + t 2 + t 3 + t 4 + t 5 + t 6 ) ( 1 + t 6 + t 1 2 + t 1 8 + t 2 4 + t 3 0 + t 3 6 + t 4 2 + t 4 8 + t 5 4 ) = t + t 2 + t 3 + ⋯ t 6 0 we see that 6 0 1 ( t + t 2 + ⋯ + t 6 0 ) = P 1 ( t ) P 2 ( t ) where P 1 ( t ) P 2 ( t ) = 6 1 ( t + t 2 + t 3 + t 4 + t 5 + t 6 ) = 1 0 1 ( 1 + t 6 + t 1 2 + t 1 8 + t 2 4 + t 3 0 + t 3 6 + t 4 2 + t 4 8 + t 5 4 ) = 2 0 1 ( 2 + 2 t 6 + 2 t 1 2 + 2 t 1 8 + 2 t 2 4 + 2 t 3 0 + 2 t 3 6 + 2 t 4 2 + 2 t 4 8 + 2 t 5 4 ) and so we can obtain the desired result by combining a normal 6 -sided die labelled with { 1 , 2 , 3 , 4 , 5 , 6 } and a 2 0 -sided die labelled with { 0 , 0 , 6 , 6 , 1 2 , 1 2 , 1 8 , 1 8 , 2 4 , 2 4 , 3 0 , 3 0 , 3 6 , 3 6 , 4 2 , 4 2 , 4 8 , 4 8 , 5 4 , 5 4 } .
The answer is 2 6 .