Imagine, a fair dice has n faces each of which shows up with equal probability. Tuktuki keeps throwing the dice until each of the sides shows up at least once. That is, if the sides are numbered to be 1,2,3,4,5,6 then the sequence "1223114665" meets up the condition as each of the numbers 1,2,3,4,5,6 has showed up at least once.
Calculate the expected number of throws Tuktuki has to make if n=12.
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.
Let X(n) be the number of rolls of the dice required to obtain all n numbers. Then we can write X ( n ) = X ( n ) 1 + X ( n ) 2 + ⋯ + X ( n ) n E [ X ( n ) ] = j = 1 ∑ n E [ X ( n ) j ] where X ( n ) j is the number of additional rolls required to achieve the j th different number after achieving j − 1 different numbers. Then X ( n ) j has a geometric distribution with probability of success n n + 1 − j , and standard theory of the geometric distribution tells us that E [ X ( n ) j ] = n + 1 − j n , and hence E [ X ( n ) ] = j = 1 ∑ n n + 1 − j n = n H n where H n is the n th harmonic number. To 3 significant figures, we have E [ X ( 1 2 ) ] = 3 7 . 2 3 9 .