Combinatorics: Counting, Permutations vs Combinations

Combinatorics is the mathematics of counting arrangements and selections without listing them one by one. The two questions that decide almost every basic problem are: does order matter? and can items repeat? If order matters, you are counting permutations; if it does not, you are counting combinations.

The engine behind both is the fundamental counting principle: if one choice can be made in $m$ ways and a second independent choice in $n$ ways, the pair can be made in $m \times n$ ways.

The Fundamental Counting Principle

Multiply the number of options at each independent stage. A cafe with $4$ sandwiches and $3$ drinks offers

different meals. The principle extends to any number of stages: a $4$-digit PIN where each digit can be $0$–$9$ has $10 \times 10 \times 10 \times 10 = 10^4 = 10{,}000$ possibilities, because repetition is allowed and each position is an independent choice.

When the question joins separate cases with "or" instead of stages with "and," you add instead of multiply.

Factorials: The Building Block

The factorial $n!$ counts the ways to arrange $n$ distinct items in a row:

For example, $5! = 120$, so five books can be ordered on a shelf in $120$ ways. By definition $0! = 1$, which keeps the formulas below consistent.

Permutations: When Order Matters

A permutation is an ordered arrangement. The number of ways to arrange $r$ items chosen from $n$ distinct items is:

Each position is filled by the counting principle: $n$ options for the first slot, $n-1$ for the second, and so on for $r$ slots. Rankings, race finishes, passwords without repeated characters, and seating orders are all permutation problems.

Combinations: When Order Does Not Matter

A combination is a selection where only membership counts. The number of ways to choose $r$ items from $n$ is:

It is the permutation count divided by $r!$, because each unordered group of $r$ items was counted $r!$ times — once per internal ordering. Committees, pizza toppings, lottery draws, and hands of cards are combination problems.

Permutation vs Combination at a Glance

The same $n$ and $r$ give a much larger permutation count — order multiplies the possibilities by $r! = 6$ here.

Worked Example: Electing Club Officers (Permutation)

A club with $10$ members elects a president, a vice president, and a treasurer. No one can hold two offices. How many outcomes are there?

Order matters because the three positions are different. Using the permutation formula with $n = 10$ and $r = 3$:

There are $720$ possible officer slates. Notice you never need the full value of $10!$ — the $7!$ cancels, leaving just three factors.

Worked Example: Choosing a Committee (Combination)

The same club instead forms a $3$-person committee with equal roles. Now order does not matter, so divide out the $3! = 6$ internal orderings:

There are $120$ possible committees. Comparing the two examples makes the core idea concrete: the only difference between $720$ and $120$ is whether the three selected people are distinguishable by role.

Common Combinatorics Mistakes

The most frequent error is using a permutation when the problem is a combination, or the reverse. Test yourself with the wording: "arrange" and "rank" signal order; "choose" and "select" usually do not.

A second mistake is forgetting repetition. Choosing $r$ items from $n$ with repetition allowed and order mattering gives $n^r$, not $\,{}_{n}P_{r}$. A 4-character code over $26$ letters has $26^4$ options, far more than $\frac{26!}{22!}$.

Students also double count when cases overlap. If you count "hands with at least one ace" by picking an ace first and then any four cards, hands with two aces get counted twice; the complement method avoids this.

Finally, adding when you should multiply: stages connected by "and then" multiply, while mutually exclusive cases connected by "or" add.

Where Combinatorics Is Used

Counting is the backbone of probability: the chance of an event with equally likely outcomes is favorable count over total count, and both counts usually come from permutations or combinations. The values $\binom{n}{r}$ are exactly the coefficients in the binomial theorem, they fill Pascal's triangle, and they appear in statistics through the binomial distribution. Beyond math class, combinatorics drives password security estimates, tournament scheduling, network design, and algorithm analysis.

Check Your Understanding

Decide before computing: a librarian picks $4$ of $12$ novels to display in a row in the front window. Is that a permutation, a combination, or both stages combined? Work it out, then verify your reasoning step by step with a math solver if the two-stage answer — choose, then arrange — does not land at $\frac{12!}{8!} = 11{,}880$.