58. Consider the coupon collecting problem where there are m distinct types of coupons, and each new coupon collected is type j with probability pj ,

mj

=1 pj = 1.

Suppose you stop collecting when you have a complete set of at least one of each type. Show that

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

Transcribed Image Text:

Phi is the last type collected) = [[[(U)] E(1 iti