Permutations and Combinations: Why Order Changes the Count

Five people volunteer for a project. You need a captain and a deputy. Choose the captain in five ways, then the deputy in four ways. There are twenty assignments.

Now change one sentence: you need a two-person committee, with no separate roles. The same five people produce ten committees. Nothing happened to the people. What changed was the definition of an outcome.

Permutations and combinations are two ways to count outcomes without listing every possibility. The formulas make sense once you decide what information the outcome keeps. This article builds that decision first, then derives the notation.

Start with positions, not a formula

Imagine two empty boxes labeled captain and deputy. The first box has five possible occupants. After filling it, four people remain for the second. Every first choice has four continuations, giving:

$$5 \times 4 = 20$$

This is the multiplication principle. If each option at one stage has the same number of possible continuations, multiply the stage counts. You can picture a tree with five branches, each splitting into four more.

The labels matter. Alex as captain and Bea as deputy is different from Bea as captain and Alex as deputy. They are the same people in different positions. That is an ordered selection, called a permutation.

A committee has no labeled positions. Writing Alex, Bea or Bea, Alex describes the same group. If you use the twenty-assignment count for committees, you have counted every group twice.

The swap test tells you whether order matters

Ask: if I swap two selected items, do I get a different outcome?

For a race podium, yes. Gold and silver are different results. For a set of pizza toppings, usually no. Mushrooms plus olives is the same selection as olives plus mushrooms.

The question is about the model, not the noun. A book problem might ask you to choose three books to buy, where order is ignored, or arrange three books on a shelf, where order is recorded. “Books” does not tell you which formula applies.

Write a sample outcome before calculating. “Captain Alex, deputy Bea” contains roles. “The group containing Alex and Bea” does not. This small step prevents more mistakes than memorizing a longer formula sheet.

Situation	What the outcome records	Model
Award gold, silver, and bronze	Person in each place	Ordered, no repetition
Select three committee members	Membership only	Unordered, no repetition
Make a four-digit code	Digit in each position	Ordered, repetition may be allowed
Choose several scoops of ice cream	Flavor quantities	Unordered, repetition may be allowed

The last two rows need the repetition question as well. Do not decide from order alone.

Factorials count complete arrangements

Line up four distinct books. There are four choices for the first place, three for the second, two for the third, and one for the last:

$$4! = 4 \times 3 \times 2 \times 1 = 24$$

The exclamation mark means factorial. It abbreviates the descending product. For a nonnegative integer $n$, factorial counts arrangements of all $n$ distinct items.

Why is $0! = 1$? There is one empty arrangement. You do nothing, and the empty arrangement is complete. This is also the value that keeps $1! = 1 \times 0!$ consistent.

Do not read factorial as repeated addition or as a power. Four factorial is twenty-four; four to the fourth power is two hundred fifty-six. A factorial's choices shrink because an item cannot be used again. A power's choices stay constant.

Permutations stop the product early

Suppose there are seven runners and you want only the first three finishers, with no ties. You have seven choices for first, six for second, and five for third:

$$P(7,3) = 7 \times 6 \times 5 = 210$$

You do not care how the remaining four runners finish. Multiplying all the way to one would answer a different question.

For $r$ ordered positions filled from $n$ distinct items without repetition:

$$P(n,r) = \frac{n!}{(n-r)!}$$

The denominator cancels the unused tail of the factorial. In the runners example, dividing seven factorial by four factorial leaves exactly seven times six times five.

This formula assumes $0 \le r \le n$ and distinct available items. If the problem changes those assumptions, return to the boxes rather than forcing the numbers into the expression.

Combinations remove duplicate arrangements

Choose three people from seven for a committee. The ordered count is 210, but it treats different arrangements of the same trio as different answers.

Take one trio, Alex, Bea, and Chen. Its members can be listed in six orders: ABC, ACB, BAC, BCA, CAB, and CBA. Every trio appears exactly six times in the ordered count, because $3! = 6$.

Divide by the number of duplicate arrangements:

$$\binom{7}{3} = \frac{210}{6} = 35$$

In general:

$$\binom{n}{r} = \frac{n!}{r!(n-r)!}$$

Read this as “n choose r.” The first division removes unused items from the arrangement count; the second removes orders you no longer distinguish.

There is a useful symmetry here: $\binom{7}{3} = \binom{7}{4}$. Choosing the three people who join also identifies the four who do not. The two descriptions point to the same set of decisions.

Repetition changes the question again

A four-digit code can use any digit from zero to nine in every position, including at the beginning. Repeated digits are allowed. Each box has ten choices:

$$10^4 = 10000$$

If no digit can repeat, the count becomes:

$$10 \times 9 \times 8 \times 7 = 5040$$

If the problem says “four-digit number” instead of “code,” a leading zero is normally excluded. With repetition allowed, that gives:

$$9 \times 10 \times 10 \times 10 = 9000$$

Three very similar sentences, three different counts. The formula did not become unreliable. The restrictions changed.

Unordered selection with repetition, such as choosing scoops with repeat flavors, requires another counting method. Ordinary combinations assume each available item can be selected at most once. Recognizing that a familiar formula does not apply is a correct first step.

Work through the decision in this order

Before calculating, write down what one complete outcome looks like. Then ask whether order or roles distinguish outcomes, whether an item can repeat, and whether a special restriction applies to any position.

Try these three problems without looking at the answers immediately:

1. From six people, choose a chair and a secretary, with nobody holding both roles.
2. From those same six people, choose two equal-status representatives.
3. Make a three-character code using four symbols, with repetition allowed.

The first has $6 \times 5 = 30$ assignments. The second divides that by $2!$, giving fifteen pairs. The third has $4^3 = 64$ codes because all four symbols remain available at every position.

The explanation matters more than the number. If you can say why one answer divides by two and another does not, you understand the distinction.

Counting is the foundation for probability

When equally likely outcomes are counted correctly, you can form probabilities by comparing favorable outcomes with all possible outcomes. Our intuitive probability guide takes that next step. The birthday paradox shows how a carefully chosen count can make a surprising result manageable.

For now, keep the skill small: define an outcome, draw the positions if there are any, and explain every factor. Use Math Zen probability practice for the next application, and return to a small example whenever the notation starts hiding the reasoning.

A permutation keeps the arrangement. A combination keeps the membership. The division by a factorial is simply the work of forgetting the arrangement without counting the same group again.