DISTRIBUTION OF A SUM OF WAITING TIMES IN COUPON COLLECTION.
STANFORD UNIV CALIF DEPT OF STATISTICS
Pagination or Media Count:
The problem of approximating the distribution of the sum of n times to collect all of M coupons is considered. The Edgeworth expansion is obtained to terms of order n to the -32 power. Tables are given for M 30, n 8, 16, and 32, of the accuracy of the Edgeworth expansion for the cumulative distribution function approximately because of discreteness .001, .01, .1, .9, .99, and .999. Author