1
$\begingroup$

I have $n$ sets and $k$ elements with $k\gt n$. Each elements has the same probability $\left(\frac1n\right)$ to be inserted in a set. All the elements have to be inserted in one single set.

I need to calculate the probability the difference of number of elements between the fuller set and the emptier one is at least $X\%$.

For example, given $10$ sets and $100$ elements I need to calculate the probability one sets has at least the $10\%$ of elements more than another.

  • 0
    OK, this is what you need. And what did you try to do that?2012-08-03
  • 0
    I thought in the beginning find all the possible combination of n number which the sum of all of them is equal to k. After that I should to enumerate all the sequence where min{Sn}/max{Sn}>=0.9. After that it's easy. But my mathematics lacks and I don't know how to go further.. I can solve it only by computational brute force but it is not good for my analytical purpose.2012-08-03
  • 0
    I don't think that this problem has a simple solution. Approximate formulations (Poisson approximations) would only be useful for large $n$,$k$, and still the formulas would be quite complex. Even computing the probabilities for the maximum alone is difficult, see eg https://math.dartmouth.edu/archive/m19w03/public_html/Section6-5.pdf2014-12-16

0 Answers 0