Here's a question from my probability textbook:
All the combinations of $n$ letters, $r$ together, repetitions permissible, are written down. Find the chance that a combination selected at random will contain no repetition. ($n \ge r$)
Here's what I did. Clearly the numerator is $\binom{n}{r}$, and the denominator is going to be the number of nonnegative integer solutions to$$\ell_1 + \ell_2 + \ldots + \ell_{n-1} + \ell_n = r.$$However, I'm not sure how to compute that. I've tried messing with stars and bars, but didn't get anywhere. Can anyone give me a hint on how to proceed? No complete solutions please.
EDIT: There seems to be some confusion in the comments which maybe I've inadvertently contributed to. The problem statement says:
All the combinations of $n$ letters, $r$ together, repetitions permissible, are written down.
I interpret this as follows. If I have the $4$ letters $a$, $b$, $c$, $d$, and we're letting $r = 3$, then the possible combinations are:$$aaa, bbb, ccc, ddd, aab, aac, aad, bba, bbc, bbd, cca, ccb, ccd, dda, ddb, ddc, abc, abd, acd, bcd,$$for a total of$$4 + 4(3) + 4 = 20$$combinations written down.
EDIT 2: Okay, I ended up getting $\binom{n + r - 1}{r}$ for the number of nonnegative integer solutions to$$\ell_1 + \ell_2 + \ldots + \ell_{n-1} + \ell_n = r,$$so the desired probability is$${{\binom{n}{r}}\over{\binom{n + r - 1}{r}}} = {{n!(n-1)!}\over{(n+r-1)!(n-r)!}}.$$Is there a way to simplify this expression any further?