Xpectation Mania #2

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.

37.239 27.239 144 12 17.239

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.

1 solution

Mark Hennings
May 14, 2021

Let X(n) be the number of rolls of the dice required to obtain all n 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 ] X(n) \; = \; X(n)_1 + X(n)_2 + \cdots + X(n)_n \hspace{2cm} \mathbb{E}[X(n)] \; = \; \sum_{j=1}^n \mathbb{E}[X(n)_j] where X ( n ) j X(n)_j is the number of additional rolls required to achieve the j j th different number after achieving j 1 j-1 different numbers. Then X ( n ) j X(n)_j has a geometric distribution with probability of success n + 1 j n \tfrac{n+1-j}{n} , and standard theory of the geometric distribution tells us that E [ X ( n ) j ] = n n + 1 j \mathbb{E}[X(n)_j] = \tfrac{n}{n+1-j} , and hence E [ X ( n ) ] = j = 1 n n n + 1 j = n H n \mathbb{E}[X(n)] \; = \; \sum_{j=1}^n \frac{n}{n+1-j} \; = \; nH_n where H n H_n is the n n th harmonic number. To 3 3 significant figures, we have E [ X ( 12 ) ] = 37.239 \mathbb{E}[X(12)] = \boxed{37.239} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...