Counting Principles

Welcome, students! 🎯 In this lesson, you will learn how counting principles help us find the number of possible outcomes in a situation without listing everything one by one. This is a major idea in combinatorics, and it appears in many places in mathematics, computer science, probability, and everyday problem-solving. By the end of this lesson, you should be able to explain the main ideas and terminology behind counting principles, use them to solve problems, and see how they connect to the broader themes of Number and Algebra.

Introduction: why counting matters

Imagine a school event where students can choose a shirt, a badge, and a lunch option. If there are several choices for each item, how many different combinations are possible? You could try listing them all, but that becomes slow and messy very quickly. Counting principles give you a smarter way to answer questions like this. ✅

In IB Mathematics: Analysis and Approaches HL, counting principles are important because they support later ideas in probability, sequences, and algebraic reasoning. They also help you think carefully about structure: when choices are independent, when order matters, and when repeated items are allowed. These distinctions are essential, because the wrong counting method leads to the wrong answer.

Key objectives for this lesson

Explain the main ideas and terminology behind counting principles.
Apply counting methods to structured problems.
Connect counting principles to broader ideas in Number and Algebra.
Use examples to justify reasoning clearly and accurately.

The multiplication principle and addition principle

The two most basic counting ideas are the multiplication principle and the addition principle.

The multiplication principle says that if one task can be done in $m$ ways and a second independent task can be done in $n$ ways, then the two tasks together can be done in $m n$ ways. This works when choices happen in sequence and each choice does not change the number of options for the next choice.

For example, if students chooses one of $3$ lunch options and one of $4$ drink options, then the total number of lunch-and-drink combinations is $3 \times 4 = 12$.

The addition principle says that if one option can be chosen in $m$ ways and another separate option can be chosen in $n$ ways, and the two options cannot happen at the same time, then the total number of ways is $m+n$.

For example, if a student can join either the robotics club in $5$ ways of role assignment or the art club in $3$ ways of role assignment, and these are separate choices, then there are $5+3=8$ ways overall.

A very important skill is deciding whether to use addition or multiplication. A good question to ask is: “Am I combining stages of one process, or choosing between separate possibilities?” 🤔

Factorials, permutations, and the role of order

When counting arrangements, order often matters. This leads to permutations.

The factorial notation $n!$ means

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

for a positive integer $n$, with $0! = 1$ by definition.

Factorials appear because they count the number of ways to arrange $n$ distinct objects in a line. For example, $4! = 24$, so there are $24$ ways to arrange $4$ different books on a shelf.

If students has $5$ different books and wants to place $3$ of them in a row, the number of arrangements is

$5 \times 4$ $\times 3$ = 60

This is because the first position has $5$ choices, the second has $4$, and the third has $3$. In general, the number of ways to arrange $r$ objects chosen from $n$ distinct objects is

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

This is called a permutation of $n$ objects taken $r$ at a time.

Order matters in permutations. For instance, if three students are selected as president, vice-president, and treasurer, then selecting Alice for president and Ben for vice-president is different from selecting Ben for president and Alice for vice-president. The positions are different, so the arrangements are different.

Combinations: when order does not matter

Sometimes we only care about which objects are chosen, not the order. That leads to combinations.

If students chooses $r$ objects from $n$ distinct objects and order does not matter, the number of ways is

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

This is also written as $\binom{n}{r}$.

For example, choosing $3$ students out of $10$ for a project group gives

$\binom{10}{3} = \frac{10!}{3!7!} = 120$

Here, the order does not matter. A group with Alice, Ben, and Chen is the same group no matter how the names are listed.

A useful relationship is that permutations and combinations are connected by

${}_nP_r = {}_nC_r \cdot r!$

This makes sense because after choosing the $r$ objects, there are $r!$ ways to arrange them.

Counting with repeated choices and restrictions

Real problems often include restrictions. The key is to split the problem into manageable parts and use the correct rule in each part.

Repetition allowed

If a code has $4$ digits and each digit can be any of $10$ digits from $0$ to $9$, then the number of codes is

$10^4$

because each position has $10$ choices and the choices are independent. This is a common example of repeated selection with order mattering.

Restrictions

Suppose a password has $3$ letters chosen from the $26$ letters of the alphabet, and letters cannot repeat. Then the number of passwords is

$26 \times 25 \times 24$

If repetition were allowed, it would instead be

$26^3$

This difference matters a lot. One repeated choice changes the counting method completely.

Using complementary counting

Sometimes it is easier to count the total number of outcomes and subtract the unwanted ones. This is called complementary counting.

For example, if a class has $20$ students and students wants to count the number of ways to choose a group of $2$ students with at least one girl, it may be easier to count all pairs and subtract the all-boy pairs. If there are $12$ girls and $8$ boys, then the total number of pairs is

$\binom{20}{2}$

The number of all-boy pairs is

$\binom{8}{2}$

So the number of pairs with at least one girl is

$\binom{20}{2} - \binom{8}{2}$

This method is powerful when direct counting is complicated. 🧠

The binomial theorem and algebraic structure

Counting principles also appear in algebra through the binomial theorem. When expanding

$(a+b)^n$

the coefficients are combinations.

The general term in the expansion is

$\binom{n}{r} a^{n-r} b^r$

for $r=0,1,2,\dots,n$.

For example,

(a+b)^3 = a^3 + 3a^2b + 3ab^2 + b^3

The coefficients $1,3,3,1 come from combinations:

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

This is an important link between counting and algebraic structure. Counting tells us how many ways terms are formed during expansion.

For HL students, this connection is valuable because it shows that counting is not just about lists of objects. It also helps explain patterns in powers, coefficients, and identities.

How to choose the correct counting method

When solving a counting problem, students should follow a clear strategy:

Identify whether order matters.
Check whether repetition is allowed.
Decide whether the problem uses addition, multiplication, permutations, or combinations.
Look for restrictions and use complementary counting if helpful.
Break complex problems into stages.

For example, suppose a committee of $4$ people is to be chosen from $7$ students, and one of the $7$ students must be included. To count the committees, first include the required student, then choose the remaining $3$ from the other $6$ students:

$\binom{6}{3}$

This is much simpler than trying to count all committees and removing the invalid ones.

Good counting is not about memorizing one formula. It is about understanding the structure of the situation. That is what makes these ideas useful in IB Mathematics: Analysis and Approaches HL.

Conclusion

Counting principles are a foundation of Number and Algebra because they teach structured reasoning, careful use of formulas, and logical problem-solving. The multiplication and addition principles help count stages and choices. Permutations and combinations help separate situations where order matters from situations where it does not. Factorials, repeated choices, restrictions, and complementary counting give you tools for more complex problems. The binomial theorem shows that counting also connects deeply to algebra.

If students can identify the structure of a counting problem, then the correct method becomes much clearer. That skill will support future work in probability, algebra, and proof. ✅

Study Notes

The multiplication principle multiplies the number of choices in independent stages.
The addition principle adds the number of choices for separate, non-overlapping cases.
A factorial is written as $n!$, and $0!=1$.
A permutation counts arrangements where order matters.
A combination counts selections where order does not matter.
The formulas are ${}_nP_r = \frac{n!}{(n-r)!}$ and ${}_nC_r = \frac{n!}{r!(n-r)!}$.
Repetition changes the counting method; for example, $10^4$ counts $4$-digit codes with repetition.
Complementary counting finds the total and subtracts the unwanted cases.
The binomial coefficients in $(a+b)^n$ are combinations: $\binom{n}{r}$.
Counting principles are closely connected to algebraic structure and later probability topics.
Always ask: does order matter, and is repetition allowed?