Permutations and Combinations

Introduction: Why order matters in counting 🎯

students, imagine you are planning a school event. You need to choose a class president, vice president, and secretary from a group of students. Now compare that with choosing three students to be on a committee, where the order of the names does not matter. These are two different counting situations, and Discrete Mathematics gives us the tools to handle both.

In this lesson, you will learn the main ideas behind permutations and combinations, how to tell them apart, and how to use them in real counting problems. The big idea is simple: sometimes order matters, and sometimes it does not. Knowing which case you are in is the key to solving the problem correctly.

Learning goals

Explain what permutations and combinations mean.
Decide whether order matters in a counting situation.
Use formulas for permutations and combinations correctly.
Connect these ideas to other Counting I topics like the product rule and binomial coefficients.
Solve real examples using clear reasoning.

Permutations: counting when order matters 🔢

A permutation is an arrangement of objects where the order is important. If you change the order, you get a different result. This is why permutations are used when you are assigning roles, arranging seats, or listing items in a sequence.

For example, suppose three students, A, B, and C, are assigned the roles of president, vice president, and secretary. The assignment $ABC$ is different from $BAC$ because the roles are different. So this is a permutation problem.

The factorial idea

The symbol $n!$ means factorial, and it is the product of all positive integers from $1$ up to $n$:

$$n! = n(n-1)(n-2)\cdots 3\cdot 2\cdot 1$$

By definition, $0! = 1$.

Factorials help us count arrangements. If you have $n$ distinct objects and want to arrange all of them, the number of possible arrangements is $n!$.

Example: arranging books 📚

If you have $4$ different books and want to place them on a shelf, the number of possible arrangements is

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

Each order is different, so this is a permutation count.

Permutations of $r$ objects chosen from $n$

Often, you do not use all $n$ objects. Instead, you choose $r$ objects from $n$ and arrange them. The number of such permutations is

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

This formula works because you first have $n$ choices for the first position, then $n-1$ for the next, and so on until you fill $r$ positions.

Example: choosing class officers 👥

Suppose $5$ students are available, and you need to choose a president, vice president, and secretary. Since the roles are different, order matters. The number of ways is

$$P(5,3) = \frac{5!}{(5-3)!} = \frac{5!}{2!} = \frac{120}{2} = 60$$

So there are $60$ possible officer assignments.

Why permutations fit the product rule

Permutations are closely connected to the product rule. If one choice has $n$ options and the next has $n-1$ options, and this continues for $r$ positions, then the total is

$$n(n-1)(n-2)\cdots (n-r+1)$$

This is the same as

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

So permutations are really a smart way to organize repeated use of the product rule.

Combinations: counting when order does not matter 🧩

A combination is a selection where order does not matter. If you choose the same group of objects in a different order, it is still the same combination.

For example, if you choose $3$ students for a committee, the group $\{A,B,C\}$ is the same as $\{B,C,A\}$. The order of names does not change the committee.

Combination formula

The number of ways to choose $r$ objects from $n$ objects, without regard to order, is

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

This is read as “$n$ choose $r$.”

Example: committee selection

Suppose a teacher chooses $3$ students from a class of $5$ to form a committee. The number of committees is

$$\binom{5}{3} = \frac{5!}{3!2!} = \frac{120}{6\cdot 2} = 10$$

So there are $10$ possible committees.

Why combinations are smaller than permutations

If you first count ordered arrangements and then realize order does not matter, you have counted each group too many times. For a group of $r$ people, there are $r!$ different orders of the same selection. That is why

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

This formula shows the relationship between permutations and combinations clearly.

Real-world example: picking toppings 🍕

Suppose you choose $2$ toppings from $6$ available pizza toppings. If the order of toppings does not matter, this is a combination problem:

$$\binom{6}{2} = \frac{6!}{2!4!} = 15$$

A pepperoni-and-mushroom pizza is the same choice as a mushroom-and-pepperoni pizza.

How to tell the difference between permutations and combinations ✅

The most important skill in this lesson is deciding whether order matters.

Ask yourself:

Does changing the order create a different outcome?
Are you assigning positions or roles?
Are you just selecting a group?

If order matters, use permutations. If order does not matter, use combinations.

Quick comparison table

Permutation: order matters, arrangement, ranking, assignment
Combination: order does not matter, selection, group, committee

Example: passwords vs. teams

Suppose a $4$-digit code is created using different digits. The order of digits matters, so this is a permutation-style situation.

Now suppose you choose $4$ students out of $10$ for a math team. The order of the chosen students does not matter, so this is a combination.

A common mistake

A common error is using combinations when the problem is really about assigning positions. For example, if you are choosing a gold, silver, and bronze medal winner from $8$ runners, the order matters because each medal is different. The correct count is

$$P(8,3) = \frac{8!}{5!} = 8\cdot 7\cdot 6 = 336$$

Using $\binom{8}{3}$ would be wrong because it ignores the different medal positions.

Binomial coefficients and Counting I 🌟

Combinations are also called binomial coefficients because they appear in the expansion of expressions like

$$(x+y)^n$$

The coefficient of $x^{n-r}y^r$ is

$$\binom{n}{r}$$

This means binomial coefficients are not just counting tools; they also appear in algebra.

For example, in the expansion of

$$(x+y)^3$$

the coefficients are $1,3,3,1, which come from

$$\binom{3}{0},\binom{3}{1},\binom{3}{2},\binom{3}{3}$$

This connection shows how Counting I supports later topics in Discrete Mathematics.

Counting paths through a problem

Many counting problems can be solved by splitting them into steps. First use the product rule to count choices, then adjust for order if needed, and finally decide whether a permutation or combination formula is the best fit.

For example, if students is selecting a $2$-person panel from $7$ students and then assigning a chairperson and recorder within that panel, you can think in stages:

Choose the panel with $\binom{7}{2}$.
Assign roles within the panel with $2!.

The total number of ordered panels is

$$\binom{7}{2}\cdot 2! = P(7,2)$$

That is a good example of how the ideas work together.

Conclusion: the big picture of Counting I 🧠

Permutations and combinations are two core ideas in Counting I. They help you count outcomes in a careful and reliable way. The main question is always whether order matters. If it does, use permutations. If it does not, use combinations.

These tools are built from the product rule and factorials, and combinations are also the same numbers that appear as binomial coefficients. Together, they form a foundation for many topics in discrete mathematics, including probability, algebraic expansions, and more advanced counting problems.

When students faces a counting problem, the best strategy is to identify the situation, ask whether order matters, and then choose the correct method. That habit leads to accurate answers and strong reasoning.

Study Notes

A permutation counts arrangements where order matters.
A combination counts selections where order does not matter.
The factorial notation is $n! = n(n-1)(n-2)\cdots 1$, and $0! = 1$.
The permutation formula is $P(n,r) = \frac{n!}{(n-r)!}$.
The combination formula is $\binom{n}{r} = \frac{n!}{r!(n-r)!}$.
Combinations and binomial coefficients are the same numbers.
If changing the order changes the outcome, use permutations.
If changing the order does not change the outcome, use combinations.
Permutations are connected to the product rule because they count step-by-step choices.
Combinations are useful for committees, teams, and any selection where order is irrelevant.
These ideas are part of Counting I and support later topics like probability and binomial expansions.