Suppose that $n$ balls are randomly put in $k$ boxes, with uniform chance; called the uniform multinomial distribution. I'm interested in the chance that no box is empty. In other words, the chance that the minimum number of balls in any box is greater than zero.
By the definition of multinomial distribution one obtains: $$ P(\mbox{no box empty}) = \frac{n!}{k^n}\sum_{\vec{x}} \frac{1}{x_1! \cdots x_k!}, $$ where the sum is over all $k$-vectors $\vec{x}$ with only positive integer entries that sum up to $n$.
I'm wondering whether this formula can be simplified or approximated.
By the way, this is the "opposite" question of https://mathoverflow.net/questions/104948 where a formula for the maximum number of balls in any box is asked.