Page 42 - HSC Combinatorics

1. HSC-Combinatorics - an Introduction

Combinatorics is the mathematics of counting, arranging, and selecting objects. In the HSC Extension 1 course, it is notoriously one of the most difficult topics because there is rarely a single "formula" to plug numbers into. A single changed word in a question—such as "distinct" versus "identical," or "in a line" versus "in a circle"—completely changes the underlying mathematical approach. Students historically struggle here because it relies heavily on logical reasoning and case-by-case analysis rather than pure algebraic manipulation. This booklet systematically breaks down the language of combinatorics so you can translate tricky English phrasing into precise mathematical operations.

2. Learning Outcomes & Syllabus Mapping

• Permutations and Combinations.
• Solve problems involving permutations of distinct and non-distinct items.
• Calculate combinations and apply them to probability scenarios.
• Apply the Pigeonhole Principle to prove combinatorial statements.
• Solve problems involving arrangements in a circle (circular permutations).

3. Prerequisites

• Must understand basic Probability (Year 11).
• Familiarity with set theory, Venn diagrams, and the fundamental counting principle (multiplication and addition rules).

4. Common HSC Mistakes

The most frequent error is overcounting—forgetting to divide by the factorial of identical items when arrangements are indistinguishable. Students also heavily confuse when order matters (Permutations) versus when it doesn't (Combinations). Another trap is failing to consider overlapping cases and neglecting the inclusion-exclusion principle.

5. Sample Worked Problem

6. Exam Strategy & Weighting

Combinatorics generally accounts for a significant portion of the Extension 1 paper. You will likely see multiple-choice questions on basic selections, followed by a more complex question in the later sections (Questions 13 or 14) that requires case-based reasoning or circular arrangements. Because these questions can be completed quickly if you know the logic, they are excellent time-savers, allowing more time for heavier calculus problems.

7. Key Definitions / Glossary Summary

• Permutation: An arrangement where order does matter ($nPr$).
• Combination: A selection where order does not matter ($nCr$).
• Factorial ($n!$): The product of all positive integers less than or equal to $n$.
• Pigeonhole Principle: If $n$ items are put into $m$ containers, with $n > m$, then at least one container must contain more than one item.

8. Frequently Asked Questions (FAQ)

• Q: Do I need to memorize the formulas for $nPr$ and $nCr$? A: While they are on the NESA reference sheet, memorizing them and knowing how to simplify factorials algebraically is critical for speed and solving proof-based questions.
• Q: Are these concepts tested across all mathematics courses? A: No, in the current syllabus, Permutations and Combinations are strictly assessed in the Extension 1 and Extension 2 courses (often tied with Probability).

9. Where to next?

Since combinatorial techniques are heavily utilized to find sample spaces, the most logical next step is to master the HSC-Probability booklet, followed by HSC-Distributions for binomial probability applications.