Ball-and-urn

Revision as of 02:45, 30 November 2016 by Deathbymath (talk | contribs) (n is the number of bins, and k is the number of objects. For the second case, k >= n so it must be k - 1 choose n -1)

The ball-and-urn technique, also known as stars-and-bars, is a commonly used technique in combinatorics.

It is used to solve problems of the form: how many ways can one distribute $k$ indistinguishable objects into $n$ bins? We can imagine this as finding the number of ways to drop $k$ balls into $n$ urns, or equivalently to drop $k$ balls amongst $n-1$ dividers. The number of ways to do such is ${n+k-1 \choose k}$, given there can be $0$ balls in an urn. However, if there can only be a positive amount of balls in an urn, then the number of ways to do such is ${k-1 \choose n-1}$