There are m different types of coupons. Each time a person collects a coupon it is, independently

Question:

There are m different types of coupons. Each time a person collects a coupon it is, independently of ones previously obtained, a type j coupon with probability pj,

mj

=1 pj = 1. Let N denote the number of coupons one needs to collect in order to have a complete collection of at least one of each type. Find E[N].

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: