I have a practical problem but not math experience to solve it. Consider I have a bin with n distinct numbers (n=1047 in my case). I extract x elements without replacement (say x=10), take note of them and reinsert in the bin. I repeat this process a fixed number d of times (say d=50). The question is: at the end of the d extractions how many different elements I expect I have seen?
I expected it was something like a bernulli distribution, but in this case the probability of finding an element not seen before is not constant. Thanks.