Permutations and combinations in everyday choices

Every permutation and combination question in Add Math is really asking one thing: how many ways can this happen? What decides which formula to reach for is not the size of the numbers, it is whether rearranging the same chosen items produces a genuinely different result.

Take a badminton club choosing three members for a task. If the task is "pick three players to represent the club at a tournament," it does not matter which name gets written down first, the group of three is the answer, and swapping the order of the names on the list changes nothing.

That is a combination. If instead the task is "pick a captain, a vice-captain, and a reserve," the same three names now matter in a specific order, captain is not the same job as reserve, and swapping two names creates a genuinely different outcome.

That is a permutation.

• If arranging or ordering the chosen items matters, a queue, a phone code, first/second/third place, specific roles, it is a permutation.
• If only which items are chosen matters, not the order among them, a committee, a team, a set of toppings, it is a combination.
• Any combination question can be turned into a permutation question by adding an extra instruction: "...and then arrange them."

Both formulas are built from factorial notation, so it helps to be comfortable with $n!$ before anything else.

$$n! = n \times (n-1) \times (n-2) \times \cdots \times 2 \times 1$$

To arrange $r$ objects chosen from $n$ distinct objects, where order matters:

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

To select $r$ objects from $n$ distinct objects, where order does not matter:

$$^{n}C_{r} = \frac{n!}{r!\,(n-r)!} = \frac{^{n}P_{r}}{r!}$$

That second version of the combination formula is worth remembering on its own terms: a combination is simply a permutation with the duplicate orderings divided back out. Every group of $r$ chosen items can be arranged in $r!$

different orders, and $^{n}C_{r}$ counts each such group only once.

The wording of a question is usually a strong clue, though it pays to check the situation itself rather than hunting for a single trigger word. "Arrange," "order," "form a code," "different ways to queue," and any mention of distinct positions or roles point to a permutation.

"Choose," "select," "form a team," and "form a group" point to a combination, provided the items are not then assigned to different roles.

Two questions can use nearly identical numbers and still need different formulas. Choosing 3 books from a shelf of 8 to display in a row on a shop window is a permutation, because a row has a first, second, and third position.

Choosing 3 books from the same shelf of 8 to lend to a friend is a combination, because a lent stack of books has no order attached to it.

Restrictions inside the count

Some questions add a condition, two people who must sit together, an item that must be included, a letter that cannot occupy a particular position. The most reliable way through these is usually one of two moves: treat the items that must stay together as a single block and arrange the block alongside everything else, or count the total number of arrangements and subtract the ones that break the rule.

A school badminton club has 9 members, all considered for two separate tasks.

1. Choosing 4 members to form a committee, where no member has a specific role, order does not matter, so this is a combination: $^{9}C_{4}$.
2. Choosing a captain, a vice-captain, and a secretary from the same 9 members, with no member holding two roles, order matters, so this is a permutation: $^{9}P_{3}$.

$$^{9}C_{4} = \frac{9!}{4!\,5!} = 126$$

$$^{9}P_{3} = \frac{9!}{6!} = 504$$

Notice both parts start from the same group of 9 people, yet the second answer is far larger, because assigning roles creates many more distinguishable outcomes than simply picking a group does.

Most errors on this topic come from a handful of repeated slips rather than a weak grasp of the idea.

• Using $^{n}P_{r}$ when the situation has no distinct roles or order, which overcounts by a factor of $r!$.
• Forgetting that $0!=1$, which matters whenever $r=n$.
• Substituting $n$ and $r$ into the wrong positions in the formula.
• Treating a "committee with specific roles" question as a single combination, missing that the roles need a permutation.

Permutation and combination questions read differently once the "does order matter" question becomes automatic, but getting there usually takes working through a run of mixed questions with someone checking, in real time, which formula was actually needed and why. A teacher working with you one-to-one can catch the exact moment a question was misread as a combination when it needed a permutation, and explain the fix on the spot rather than after the fact.

Our teachers are experienced; lessons run online and are taught in English, while SPM papers themselves are set bilingually in Bahasa Melayu and English.

If this chapter, or the counting techniques it leads into, like probability, is a sticking point, a one-hour paid trial class at the teacher's own rate (from RM50 per hour, depending on experience) is a reasonable place to start.