Specialist Mathematics · Unit 1 · Topic 1

Combinatorics

Count without listing. The multiplication and addition principles, inclusion–exclusion for two and three sets, factorials, permutations and combinations with restrictions, and probability by counting.

  • 8 lessons
  • 2 h 22 min of lessons
  • 16 worked examples
  • 12 hours in the syllabus
0 of 8

Start here

The multiplication and addition principles

Lesson 1 of 8 · 15 min

Start the topic

Lessons

8
  1. The multiplication and addition principles (up next)

    Count outcomes without listing them. Multiply when a task happens in stages, and add when it splits into separate cases.

  2. Inclusion–exclusion for overlapping sets

    Count the elements in a union of two or three sets without double counting, using Venn diagrams and the inclusion–exclusion formulas.

  3. Factorials and permutations

    Count the ordered arrangements of n distinct objects with n factorial, and of r objects chosen from n with the permutation formula nPr.

  4. Arrangements with restrictions

    Count arrangements where objects must sit in set positions, stay together, stay apart, or be chosen from more than one group.

  5. Arrangements with repeated objects

    Count arrangements when some objects are identical, such as the letters of TOOWOOMBA or the moves of a shortest path through a street grid.

  6. Combinations: choosing without order

    Count unordered selections with nCr, see how combinations come from permutations, and decide which one a problem needs.

  7. Selections with restrictions

    Choose committees and teams from several groups, with particular people included, excluded or kept together, and with at-least conditions.

  8. Counting and probability

    Calculate probabilities of equally likely outcomes by counting with permutations and combinations, with and without technology.

  9. Topic quiz

    Ten questions across the topic, from foundation to complex unfamiliar. Your results feed your mastery.

About this topic

How many different 4-digit PINs are there? How many ways can a team of 5 be chosen from a squad of 12? What is the chance of winning a lottery? Each is a counting question, and each answer is far too large to find by listing.

Combinatorics is the mathematics of counting without listing. You will start with two simple rules, the multiplication and addition principles, and the inclusion–exclusion principle for sets that overlap. Then you will count ordered arrangements (permutations) and unordered selections (combinations), including problems with restrictions, and use them to calculate probabilities.

Every problem comes down to two questions: does order matter, and what are the conditions? Answer those carefully and the method almost chooses itself.

Before you start

  • Listing outcomes with tables and tree diagrams (Year 10).
  • Venn diagrams and the language of sets: union, intersection and complement.
  • The probability of an event when outcomes are equally likely: favourable outcomes divided by total outcomes.
  • Solving quadratic equations by factorising.

What QCAA says you need to know13 dot points

Introduction to counting techniques

4 hours

Permutations (ordered arrangements) and combinations (unordered selections)

8 hours

Subject matter from the Specialist Mathematics General senior syllabus 2025 v1.4 (opens in a new tab), CC BY 4.0 © State of Queensland (QCAA).

The focus areas you can practise on their own. Each one maps to dot points above.

  • Multiplication principle

    Multiply the number of options at each stage when a task is done in stages, including codes with and without repetition.

    Practise
  • Addition principle

    Split a count into cases that cannot happen together, count each case and add, including counting the complement.

    Practise
  • Inclusion–exclusion

    Count the union of two or three overlapping sets without double counting, with formulas and Venn diagrams.

    Practise
  • Factorial notation

    Evaluate and simplify expressions with factorials, including 0! = 1, and solve equations involving nPr and nCr.

    Practise
  • Permutations

    Count ordered arrangements of all n objects (n!) or of r objects chosen from n distinct objects (nPr).

    Practise
  • Arrangements with restrictions

    Fixed positions, objects kept together or apart, and arrangements built from several groups.

    Practise
  • Arrangements with repeated objects

    Divide by the factorial of each repeat, for words with repeated letters and shortest paths on a grid.

    Practise
  • Combinations

    Count unordered selections with nCr, use the symmetry nCr = nC(n−r), and solve problems where order does not matter.

    Practise
  • Selections with restrictions

    Committees and teams from several groups, with particular people included, excluded or kept together, and at-least conditions.

    Practise
  • Probability by counting

    Find probabilities of equally likely outcomes by counting arrangements or selections, with and without technology.

    Practise
  • Choosing a counting method

    Decide whether order matters, whether repetition is allowed, and whether to use cases or the complement.

    Practise

Worked examples16

All 16

Common mistakes

Adding when you should multiply

Stages that all happen (a shirt and shorts and socks) multiply. Only separate cases where exactly one happens (by plane or by train) add.

Double counting an overlap

∣A∪B∣≠∣A∣+∣B∣|A \cup B| \ne |A| + |B| when the sets overlap: the elements in A∩BA \cap B are counted twice, so subtract ∣A∩B∣|A \cap B| once.

Forgetting to add back the triple overlap

With three sets, subtracting the three pair overlaps removes the centre region completely. Add ∣A∩B∩C∣|A \cap B \cap C| back.

Using a permutation for a selection

A committee, team or hand of cards has no order. nPr{}^nP_r counts each selection r!r! times; use (nr)\binom{n}{r}.

Forgetting the arrangements inside a block

When kk objects must be together, arrange the block with the rest, then multiply by k!k! for the orders inside the block (unless the objects are identical).

Not dividing out repeated objects

The letters of NOOSA give 5!2!=60\frac{5!}{2!} = 60 arrangements, not 5!=1205! = 120: swapping the two Os gives the same word.

The "choose one first" trap

For "at least one woman", choosing one woman first and then any others counts committees with two or more women several times. Use cases or the complement.

"Not all together" is not "no two together"

"Not all together" is the total minus "all together". "No two together" is smaller, and needs the gap method.

A leading zero

A 3-digit number cannot start with 0. Fill the first position before the others when 0 is available.

Mixing ordered and unordered counts

In a probability, count the event and the sample space the same way: both with permutations or both with combinations.

Exam tips

  1. Show the structure before the number: slots, cases or an expression such as (73)(62)\binom{7}{3}\binom{6}{2}. In a multi-mark question most of the marks are for the method.

  2. Cancel before you multiply in technology-free questions: (103)=10×9×83×2×1=120\binom{10}{3} = \frac{10 \times 9 \times 8}{3 \times 2 \times 1} = 120.

  3. When you add cases, name them in words, for example "3 women and 2 men, or 4 women and 1 man, or 5 women".

  4. Check an "at least" answer a second way: cases and the complement must give the same count.

  5. The QCAA formula book gives nPr{}^nP_r, nCr{}^nC_r and both inclusion–exclusion formulas. Knowing which one a problem needs is the skill being assessed.

  6. On a graphics calculator, nPr, nCr and ! are in the probability menu. In technology-active questions, still write the expression you evaluated.

  7. Judge reasonableness: a count is a whole number, a restricted count is smaller than the unrestricted one, and a probability lies between 0 and 1.

  8. Read the wording closely: "arrangements" and "codes" usually mean order matters; "selections", "teams" and "committees" usually mean it does not.

Where this shows up

  • Security: the number of possible PINs and passwords, and how long a computer would take to try them all.

  • Lotteries and games: the chance of winning when 6 numbers are drawn from 45 is 11 in (456)=8 145 060\binom{45}{6} = 8\,145\,060.

  • Quality control: the chance that a random sample from a batch contains a faulty item.

  • Sport: the number of games in a round-robin competition, (n2)\binom{n}{2} if every pair plays once.

  • Genetics: a DNA strand is a sequence of four bases, so there are 4n4^n possible strands of length nn.

  • Networks and logistics: the number of connections between nn devices, and the number of routes a delivery driver could take.

Save your progress with a free account