Let T denote the number of times we have to roll a fair dice before each face has appeared at least once and let N denote the number of different faces appearing in the first six rolls. Then
E(T|N=3) is?
Let T denote the number of times we have to roll a fair dice before each face has appeared at least once and let N denote the number of different faces appearing in the first six rolls. Then
E(T|N=3) is?
Take a look at the Coupon Collector's Problem, the idea is the same.
Given that you have obtained three faces in the first six rolls, the number of rolls $T_4, T_5$, and $T_6$ to obtain the remaining three faces is distributed as Geometric with parameter $3/6$, $2/6$, and $1/6$ respectively.
So:
$$E[T|N=3]=E[6+T_4+T_5+T_6]=6+6/3+6/2+6=17$$