2
$\begingroup$

Possible Duplicate:
A Question About Dice

You have a weighted n-sided die. Every side of the die is weighted differently where side n1 has a weight of w1, n2 has a weight of w2, ...

Estimate the average number of rolls needed to see every face at least once.

  • 0
    Voting to close as duplicate: although that question is a special case of this one, the answers address the general case.2012-10-30

1 Answers 1

1

This is a variant of the coupon collector's problem

Formula (14a) is what you need.

Updated after comments.

  • 0
    I think this may be along the lines of what i was looking for: http://programworlds.blogspot.com/2012/07/coupon-collector-simulation.html But I am trying to determine the Big O complexity with the random number generator.2012-10-29