Stars and bars (combinatorics)

Uncommon card · No. 144066

In combinatorics, stars and bars (also called sticks and stones, balls and bars, and dots and dividers) is a graphical aid for deriving certain combinatorial theorems. It can be used to solve a variety of counting problems, such as how many ways there are to put n indistinguishable balls into k distinguishable bins. The solution to this particular problem is given by the binomial coefficient (n+k−1k−1), which is the number of subsets of size k − 1 that can be formed from a set of size n + k − 1. If, for example, there are two balls and three bins, then the number of ways of placing the balls is (2+3−13−1)=(42)=6. The table shows the six possible ways of distributing the two balls, the strings of stars and bars that represent them (with stars indicating balls and bars separating bins from one another), and the subsets that correspond to the strings. As two bars are needed to separate three bins and there are two balls, each string contains two bars and two stars. Each subset indicates which...

Read on Wikipedia