Asymptotics for the random coupon collector problem

We develop techniques of computing the asymptotics of the expected number of items that one has to check in order to detect all N existing kinds, as N → ∞. The occurring frequencies of the differend kinds are random variables.