The Coupon Collector Problem is a well-known one in mathematics and statistics.
The problem assumes that all unique coupons are equally likely a priori and gives the expected (mean) number of coupons needed to be collected in order to observe one of each unique type.
The solution is:
$N = n(ln(n) + \gamma) + \frac{1}{2}$,
where $n$ is the number of unique coupons and $\gamma$ is the Euler-Mascheroni constant. $ln$ is the base of the natural logarithm.
My intrigue concerns the case where coupons are not equally likely. Further, suppose one does not know the frequencies of all unseen unique types, but can estimate the total number of unique types (both seen and unseen).
For example, suppose one collects 50 objects, of which 5 are unique. The person surmises that there are a total of 10 unique objects (thus, they need to observe 5 more unique objects). However, the frequencies at which these 5 unseen unique objects occur is NOT known beforehand.
To me, finding a solution (either a closed-form formula or via simulation) to such a problem would be very challenging, if possible at all. One can only make the claim that unseen unique types are likely very rare (low probability of detection).
Has anyone or can anyone here propose(d) a way forward?