1 min read · revised 8 October 2026 · referred to by 2 notes · ·
So imagine you are flipping a coin which has two faces (we call this unique outcomes).
If we flip it times we get ways this could turn out. This case is called with-replacement because each turn doesn't take away from the entire outcome space.
If however you consider a deck of cards (52) each time you lay one out on the table you subtract one from the space. If we draw cards we get a sequence like:
So if we wanted all the ways we could lay out our cards for the entire deck that would be . But what if we wanna constrain the we must divide by the difference:
Great, now we have all the possible ways of sampling form for some range . What if we dont care about the order tho? Well we just divide by again:
Formally we call this choose :
Fig. 1. Choosing a formula for draws from outcomes: first ask whether draws are replaced, then whether order matters. The unordered with-replacement case (multisets) is .