# Consider the coupon collecting problem where there are m distinct types of coupons, and each new… 1 answer below »

Consider the coupon collecting problem where there are m distinct types of coupons, and each new coupon collected is type j with probability pj , Suppose you stop collecting when you have a complete set of at least one of each type. Show that

Don't use plagiarized sources. Get Your Custom Essay on

Consider the coupon collecting problem where there are m distinct types of coupons, and each new…
1 answer below »

Just from $13/Page

P{i is the last type collected}

where U is a uniform (0, 1) random variable.