Example
Example 5.17 (The Coupon Collecting Problem) There are m different types of coupons. Each time a person collects a coupon it is, independently of ones previ ously obtained, a type j coupon with probability pj , m j=1 pj = 1. Let N denote
Example 5.17 (The Coupon Collecting Problem) There are m different types of coupons. Each time a person collects a coupon it is, independently of ones previ ously obtained, a type j coupon with probability pj , m j=1 pj = 1. Let N denote