Skip to content

Applied Mathematics · Ch 6 — Permutations and Combinations

Combination

6.6

Combination

We now turn to the problem of counting selections where the order of the chosen items does not matter — a combination. While a permutation arranges objects in a sequence, a combination simply picks a subset, so the same group of objects is counted only once regardless of how they are listed. This distinction is the heart of the formula nCr=n!r!(n−r)!^nC_r = \frac{n!}{r!(n-r)!}, which we w …