Hi everyone!
I have a fun problem in combinatorics to solve. I am searching for an analytical formula for the answer. Right now I use a recursive function to solve it.
A bowl contains N balls of each of L different colors (NxL balls in total). You pick M <= NxL balls without replacement. What is the probability of having picked K balls of the same color, but less of the others?
If someone can give me reference to discussion of this problem, I'ld be glad.
Best regards,
Arni Richard
Start Free Trial