Coupon Collector Reloaded

A 55-sided fair dice has an integer from 1 to 10 written on each face. Each of the numbers i = 1 to 10 i = 1 \text{ to }10 is used i i times for a total of 55 numbers.

What is the expected number of times the die needs to be rolled so that every number has appeared at least once (to 2 decimal places)?


Note: This problem might require computational aids.


Inspired by Jubayer Nirjhor


The answer is 68.984577758983.

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

Abhishek Sinha
Apr 23, 2017

This is an instance of Coupon Collector Problem with non-uniform coupon probabilities. The result is well-known .

Does this involve doing an integral over a product of exponentials?

Nathan Zhao - 5 months, 3 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...