Ultimate Guide to Permutations and Combinations in HSC Maths Ext 1

Introduction

"How many ways can this happen?" It sounds like a simple question, but in the realm of advanced mathematics, counting can quickly become incredibly complex. In the Mathematics Extension 1 course, the topic of Permutations and combinations (often called Combinatorics) shifts your brain away from standard algebra and into logical, systematic counting.

This ultimate guide covers every syllabus dot point for the Year 11 Combinatorics topic, providing you with the tools to solve some of the most conceptually challenging problems in the HSC.

Executive Summary

The "Permutations and combinations" topic (aligned with outcome ME1-11-04) equips students with the ability to solve advanced counting, ordering, and probability problems. You will learn to manipulate factorials, distinguish between ordered arrangements (permutations) and unordered selections (combinations), and apply these concepts to circles, restricted groups, and probability scenarios.

What is this about?

This deep-dive is broken into four critical areas:

Factorials and the Multiplication Principle: The fundamental building blocks of all counting problems.
Permutations: Ordering objects in a line or a circle, dealing with identical items, and handling restrictions.
Combinations: Selecting groups where order doesn't matter, and proving key combinatorial identities.
Probability: Applying these advanced counting techniques to calculate the likelihood of complex events.

Let's explore each of these areas in detail.

Main Content

1. Factorials and the Multiplication Principle

Before we can arrange or select objects, we need a way to quickly calculate large numbers of possibilities.

Factorial Notation: $n!$

The notation $n!$ (read as "n factorial") represents the product of all positive integers from $n$ down to 1. $n! = n(n-1)(n-2) \times \dots \times 3 \times 2 \times 1$ For example, $5! = 5 \times 4 \times 3 \times 2 \times 1 = 120$ .

A crucial algebraic property you must use to simplify expressions is: $n! = n \times (n-1)!$ Additionally, by mathematical convention (and to make our formulas work), we define: $0! = 1$

The Multiplication Principle

If you can make a choice in $m$ ways, and a second choice in $n$ ways, then both choices together can be made in $m \times n$ ways. By applying this principle, the number of ways to arrange $n$ distinct objects in a straight line is $n \times (n-1) \times (n-2) \dots = n!$ .

2. Permutations (Order Matters)

A permutation is an ordered selection. Think of passwords, seating arrangements, or race podiums—the order in which items are placed completely changes the outcome.

The Permutation Formula: $^nP_r$

If you have $n$ distinct objects and you want to select and arrange $r$ of them, the formula is: $^nP_r = \frac{n!}{(n-r)!}$ Notice that $^nP_n = n!$ (arranging all of them) and $^nP_0 = 1$ (there is only 1 way to arrange zero items: do nothing).

Permutations with Restrictions

HSC questions rarely ask for a simple $^nP_r$ . They will include restrictions:

Grouping: "Two people must sit together." Treat them as one single 'block'. Arrange the blocks, then multiply by the number of ways the people can arrange themselves inside the block.
Separation: "Two people must NOT sit together." Often, it is easier to find the total unrestricted arrangements and subtract the number of ways they do sit together.

Objects Not All Distinct (Identical Items)

How many ways can you arrange the letters in the word "BEEKEEPER"? If you have $n$ items, but $p$ of them are identical, $q$ of them are identical, etc., you must divide out the duplicate arrangements: $\frac{n!}{p! \times q! \dots}$

Circular Arrangements

Arranging items in a circle is different from a straight line because there is no defined "start" or "end". Rotating the circle doesn't create a new arrangement. To fix this, we effectively "lock" one person into a seat to create a starting point, leaving $(n-1)$ people to be arranged in the remaining seats.

The number of ways to arrange $n$ distinct objects in a circle is $(n-1)!$ .

3. Combinations (Order Doesn't Matter)

A combination is a selection of a subset where order is completely irrelevant. Think of selecting a committee, a hand of cards, or a team.

The Combination Formula: $^nC_r$ or $\binom{n}{r}$

To find the number of ways to select $r$ objects from $n$ distinct objects, we take the permutations ( $^nP_r$ ) and divide out the $r!$ ways those selected objects could have been ordered amongst themselves: $^nC_r = \frac{n!}{r!(n-r)!}$

Key Properties and Identities

You must be able to show and use these properties:

$^nC_n = ^nC_0 = 1$ (Selecting all or none can only happen 1 way).
$^nC_1 = ^nC_{n-1} = n$
Symmetry: $^nC_r = ^nC_{n-r}$ . Choosing $r$ objects to keep is exactly the same as choosing $(n-r)$ objects to throw away.

Pascal's Identity

You are required to prove the following identity algebraically (using factorials and common denominators) and combinatorially (using logical arguments): $^nC_r = ^{n-1}C_{r-1} + ^{n-1}C_r$ Combinatorial Proof: Imagine choosing a team of $r$ people from a group of $n$ . Pick one specific person, "Alex". Every possible team either includes Alex (meaning you choose the remaining $r-1$ people from the remaining $n-1$ group: $^{n-1}C_{r-1}$ ) or it excludes Alex (meaning you choose all $r$ people from the remaining $n-1$ group: $^{n-1}C_r$ ). Adding these two mutually exclusive cases gives the total $^nC_r$ .

4. Probability with Combinatorics

The final step is applying these counting techniques to probability. Since Probability = (Favourable Outcomes) / (Total Possible Outcomes), you will often use permutations or combinations to calculate the numerator and the denominator separately.

Always ensure you are consistent. If you use permutations for the total outcomes, you MUST use permutations for the favourable outcomes.

mini-FAQ page

Q: How do I know whether to use Permutations ( $P$ ) or Combinations ( $C$ )? A: Ask yourself: "Does swapping the items create a different outcome?" If you select Alice then Bob, is that different from Bob then Alice? If yes (like a President and Vice-President), use Permutations. If no (like a 2-person committee), use Combinations.

Q: Can I use my calculator for factorials? A: Yes, scientific calculators have an $x!$ , $nPr$ , and $nCr$ button. However, many HSC questions are algebraic (e.g., "Simplify $\frac{(n+1)!}{(n-1)!}$ "), which requires you to know how to expand factorials manually.

Q: What is the "cases" method? A: For complex restrictions (e.g., "Select a committee of 5 with at least 3 women"), you cannot do it in one calculation. You must break it into mutually exclusive cases: (Exactly 3 women) OR (Exactly 4 women) OR (Exactly 5 women). Calculate each case separately and add the results.

Common mistakes to avoid

Overcounting: When using combinations and dealing with overlapping categories (like selecting a pair of identical shoes from a pile), students often accidentally count the same pair twice. Always double-check if your method treats identical selections as unique.
Mixing $P$ and $C$ : In a single calculation stage, be very careful not to multiply a Permutation by a Combination unless you explicitly know what you are doing (e.g., selecting with a Combination, then arranging that selection with a Factorial).
Misinterpreting "At least" or "At most": These phrases are massive red flags that you need to use cases. Alternatively, look for the complementary event (Total ways - the ways you don't want).

Practice on Vu's Maths Hub

Combinatorics is notorious for being easy to read but hard to execute. The only way to master it is by exposing yourself to hundreds of different scenarios.

Sharpen your counting logic with our resources on Vu's Maths Hub:

Conquer every type of arrangement and selection with our dedicated HSC Combinatorics booklet.
See how to break down complex probability cases in our detailed Worked Solutions.
Put your logic to the ultimate test with our Extension 1 Trial Papers.

Connect with me

Don't let tricky combinatorics problems ruin your exam confidence. Join Vu's Maths Hub today and gain access to our extensive collection of Maths Booklets, Worked Solutions, and Trial Papers tailored specifically to help you master the NSW HSC curriculum.