General asymptotic estimates for the Coupon Collector Problem

We develop techniques of computing the asymptotics of the expected number of coupons that a collector has to buy in order to find all N existing different coupons, as N → ∞. The probabilities (occurring frequencies) of the coupons can be quite arbitrary.