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.
Specialist Mathematics · Unit 1 · Topic 1
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.
Count outcomes without listing them. Multiply when a task happens in stages, and add when it splits into separate cases.
Count the elements in a union of two or three sets without double counting, using Venn diagrams and the inclusion–exclusion formulas.
Count the ordered arrangements of n distinct objects with n factorial, and of r objects chosen from n with the permutation formula nPr.
Count arrangements where objects must sit in set positions, stay together, stay apart, or be chosen from more than one group.
Count arrangements when some objects are identical, such as the letters of TOOWOOMBA or the moves of a shortest path through a street grid.
Count unordered selections with nCr, see how combinations come from permutations, and decide which one a problem needs.
Choose committees and teams from several groups, with particular people included, excluded or kept together, and with at-least conditions.
Calculate probabilities of equally likely outcomes by counting with permutations and combinations, with and without technology.
Ten questions across the topic, from foundation to complex unfamiliar. Your results feed your mastery.
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.
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.
Addition principle
Split a count into cases that cannot happen together, count each case and add, including counting the complement.
Inclusion–exclusion
Count the union of two or three overlapping sets without double counting, with formulas and Venn diagrams.
Factorial notation
Evaluate and simplify expressions with factorials, including 0! = 1, and solve equations involving nPr and nCr.
Permutations
Count ordered arrangements of all n objects (n!) or of r objects chosen from n distinct objects (nPr).
Arrangements with restrictions
Fixed positions, objects kept together or apart, and arrangements built from several groups.
Arrangements with repeated objects
Divide by the factorial of each repeat, for words with repeated letters and shortest paths on a grid.
Combinations
Count unordered selections with nCr, use the symmetry nCr = nC(n−r), and solve problems where order does not matter.
Selections with restrictions
Committees and teams from several groups, with particular people included, excluded or kept together, and at-least conditions.
Probability by counting
Find probabilities of equally likely outcomes by counting arrangements or selections, with and without technology.
Choosing a counting method
Decide whether order matters, whether repetition is allowed, and whether to use cases or the complement.
Stages that all happen (a shirt and shorts and socks) multiply. Only separate cases where exactly one happens (by plane or by train) add.
when the sets overlap: the elements in are counted twice, so subtract once.
With three sets, subtracting the three pair overlaps removes the centre region completely. Add back.
A committee, team or hand of cards has no order. counts each selection times; use .
When objects must be together, arrange the block with the rest, then multiply by for the orders inside the block (unless the objects are identical).
The letters of NOOSA give arrangements, not : swapping the two Os gives the same word.
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 the total minus "all together". "No two together" is smaller, and needs the gap method.
A 3-digit number cannot start with 0. Fill the first position before the others when 0 is available.
In a probability, count the event and the sample space the same way: both with permutations or both with combinations.
Show the structure before the number: slots, cases or an expression such as . In a multi-mark question most of the marks are for the method.
Cancel before you multiply in technology-free questions: .
When you add cases, name them in words, for example "3 women and 2 men, or 4 women and 1 man, or 5 women".
Check an "at least" answer a second way: cases and the complement must give the same count.
The QCAA formula book gives , and both inclusion–exclusion formulas. Knowing which one a problem needs is the skill being assessed.
On a graphics calculator, nPr, nCr and ! are in the probability menu. In technology-active questions, still write the expression you evaluated.
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.
Read the wording closely: "arrangements" and "codes" usually mean order matters; "selections", "teams" and "committees" usually mean it does not.
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 in .
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, if every pair plays once.
Genetics: a DNA strand is a sequence of four bases, so there are possible strands of length .
Networks and logistics: the number of connections between devices, and the number of routes a delivery driver could take.