What is the average number of times it would it take to roll a fair 6-sided die and get all numbers on the die? The order in which the numbers appear does not matter.
I had this questions explained to me by a professor (not math professor), but it was not clear in the explanation. We were given the answer (1−(56)n)6=.5 or n=12.152
Can someone please explain this to me, possibly with a link to a general topic?
Answer
The time until the first result appears is 1. After that, the random time until a second (different) result appears is geometrically distributed with parameter of success 5/6, hence with mean 6/5 (recall that the mean of a geometrically distributed random variable is the inverse of its parameter). After that, the random time until a third (different) result appears is geometrically distributed with parameter of success 4/6, hence with mean 6/4. And so on, until the random time of appearance of the last and sixth result, which is geometrically distributed with parameter of success 1/6, hence with mean 6/1. This shows that the mean total time to get all six results is
6∑k=16k=14710=14.7.
Edit: This is called the coupon collector problem. For a fair n-sided die, the expected number of attempts needed to get all n values is
nn∑k=11k,
No comments:
Post a Comment