There are $n$ combinatorial lists of a certain form. I don't know what $n$ is.
I can randomly generate lists of that form. Let's say that after a million such trials I've gotten 960000 distinct lists. Let's also assume my random method has an equal likelihood of picking any of the $n$ items from the complete list.
Based on that, is there a good guess for $n$?
The coupon collector problem, birthday problem and german tank problem are related.
Is there a name for the problem?
Here's another version: I randomly sample 1000 integers from 1 to $n$ and get 800 distinct values. What is a good guess for $n$?
