Systematic listing records every outcome in a fixed, logical order, fixing one element and varying the others. Free notes and 11 questions answered.
Updated 21 Mar 2026 · Revise Right Team
Systematic Listing Strategies is part of Structure and calculation in GCSE AQA Higher Maths.
4 min
Reading time
22
Lessons in this topic
GCSE AQA Higher
Pathway
Reviewed by Revise Right
Content review
What this lesson covers
Systematic listing records every outcome in a fixed, logical order, fixing one element and varying the others. Free notes and 11 questions answered.
Apply systematic listing strategies to generate all possible outcomes without repetition or omission
Use systematic listing to find all combinations and arrangements of a set of items
Identify the total number of outcomes from a systematic list
Apply listing strategies to solve problems involving choices and selections
Revise Right Mocks '26
AQA GCSE Maths mock draft, 26–31 Oct. Draft coverage: Maths Paper 1 (Higher tier). Reviewed for an original-practice sitting; check student availability before registering. Marking and results will follow later, after separate approval. Eligible new accounts receive a five-day Pro trial when signup email verification completes. Previous trials keep their original expiry. After expiry, new papers need Pro unless you have an explicitly confirmed free sitting offer for this event. That offer adds no Pro time or AI learning. Saved attempts and released results remain readable. No card or automatic charge.
Use this lesson to stay inside Structure and calculation while connecting the detail back to the wider Number topic.
Systematic listing: A method of recording all possible outcomes in an organised, logical order so that none are missed and none are repeated.
Combination: A selection of items from a group where the order does not matter. Used when choosing items without regard to arrangement.
Arrangement (permutation): An ordered selection of items where the order does matter. Used when the position of each item changes the outcome.
Product rule for counting: A rule stating that if one event can happen in $m$ ways and a second independent event can happen in $n$ ways, the total number of outcomes is $m \times n$.
Revision notes
Read the core explanations from Systematic Listing Strategies before testing yourself from memory.
1. Why Systematic Listing Matters
Imagine you are choosing a two-course meal from a menu with 3 starters and 4 mains. How many different meals could you order? You could guess — or you could list every possibility in order and be certain you have them all. That second approach is systematic listing, and it is the foundation of this topic.
Systematic listing is not about being slow or over-cautious. It is about having a method that guarantees completeness. Examiners award marks for showing organised working, so a well-structured list is both a thinking tool and a mark-winning strategy.
The core principle is simple: fix one element, vary the rest, then move to the next fixed element. This structure prevents both repetition and gaps. You will use this principle across combinations, arrangements, and multi-stage choices throughout the lesson.
2. Listing All Combinations
A combination is a selection where order does not matter — choosing pizza and salad is the same as choosing salad and pizza. When listing combinations, the strategy is to work through the options in a fixed order, pairing each item with every item that comes after it in your list.
Worked example: Listing All Combinations from a Set
Three flavours of ice cream are available: Vanilla (V), Chocolate (C), and Strawberry (S). A customer chooses 2 different flavours. List all possible combinations.
V, C
V, S — With V fixed, pair it with every flavour that comes after V in the list: C and S. This gives 2 combinations. [M1 for systematic approach]
C, S — With C fixed, pair it only with flavours that come after C in the list. V has already been used with C, so only S remains. This avoids repeating V,C.
No new pairs — S is the last item. — All earlier flavours have already been paired with S, so there are no new combinations to add.
V,C — V,S — C,S
Total: 3 combinations — Three distinct pairs, each listed exactly once. [A1 for correct complete list]
Answer: VC, VS, CS — 3 combinations in total
Notice the pattern: by always pairing with items that come later in your fixed order, you never write the same pair twice. This is the key discipline that makes the method reliable.
3. Listing All Arrangements
Now consider a situation where order matters. Arranging the letters A, B, C in a row gives a different outcome depending on which letter comes first. AB is not the same as BA. These ordered selections are called arrangements, and the listing strategy shifts slightly.
The method is: fix the first position, then list all possible choices for the remaining positions in order. Once you have exhausted all options with that first choice, move to the next item in the first position.
Worked example: Listing All Arrangements of Three Letters
List all possible arrangements of the letters A, B, and C using each letter exactly once.
A, B, C
A, C, B — With A first, the remaining two letters B and C can be arranged in 2 ways: BC or CB. [M1 for fixing first element]
B, A, C
B, C, A — With B first, the remaining letters A and C give 2 arrangements: AC or CA.
C, A, B
C, B, A — With C first, the remaining letters A and B give 2 arrangements: AB or BA.
ABC, ACB, BAC, BCA, CAB, CBA
Total: 6 arrangements — 3 choices for position 1, then 2 choices for position 2, then 1 choice for position 3: $3 \times 2 \times 1 = 6$. [A1 for all 6 correct]
Answer: ABC, ACB, BAC, BCA, CAB, CBA — 6 arrangements in total
4. Multi-Stage Choices and the Product Rule
Many exam questions involve choices made in stages — for example, picking an outfit by choosing a top and then trousers separately. When each stage is independent, you can find the total number of outcomes by multiplying the number of options at each stage. This is the product rule for counting.
The product rule is a powerful shortcut, but you should still be able to produce the full systematic list when a question asks you to. The list confirms the count; the product rule checks it.
Worked example: Multi-Stage Choices: Meal Combinations
A café offers 3 sandwiches (Tuna, Egg, Cheese) and 2 drinks (Orange juice, Water). List all possible meal combinations and state the total.
Tuna + Orange juice
Tuna + Water — With Tuna fixed, there are 2 drink options. This gives 2 combinations. [M1 for systematic approach]
Egg + Orange juice
Egg + Water — With Egg fixed, again 2 drink options. Another 2 combinations.
Cheese + Orange juice
Cheese + Water — With Cheese fixed, 2 more combinations.
$3 \times 2 = 6$ — 3 sandwich choices multiplied by 2 drink choices gives 6 total outcomes. The list confirms this. [A1 for correct total]
Systematic listing also appears in number problems — for example, finding all two-digit numbers that can be formed from a set of digits, or listing all factor pairs of a number. The same fix-and-vary principle applies.
Worked example: Listing Two-Digit Numbers from Given Digits
The digits 1, 3, and 5 are available. List all two-digit numbers that can be formed using two different digits from this set.
13, 15 — With 1 in the tens position, the units digit can be 3 or 5. This gives 13 and 15.
31, 35 — With 3 in the tens position, the units digit can be 1 or 5. This gives 31 and 35.
51, 53 — With 5 in the tens position, the units digit can be 1 or 3. This gives 51 and 53.
13, 15, 31, 35, 51, 53
Total: 6 numbers
Check: $3 \times 2 = 6$ ✓ — 3 choices for the tens digit, then 2 remaining choices for the units digit. Product rule confirms the count. [A1 for all 6 correct]
Notice how the product rule acts as a built-in check: if your list does not match the product rule total, you have either missed an outcome or written a duplicate. Always cross-check your count.
6. Practice: Putting It All Together
You have now seen systematic listing applied to combinations, arrangements, multi-stage choices, and number problems. Before looking at exam technique, work through these practice problems to consolidate the method.
7. Exam Technique and Common Mistakes
Systematic listing questions on GCSE Higher papers typically ask you to either produce the full list, state the total number of outcomes, or both. The marks are split between method (showing an organised approach) and accuracy (getting the correct complete list). A disorganised scattering of outcomes, even if correct, risks losing method marks.
When a question says "list all possible outcomes", write them in a clear, ordered format — row by row, fixing one element at a time. When a question says "how many", you may use the product rule directly, but showing a brief list or tree structure as supporting working is always safer In questions without a calculator.
Systematic listing is ultimately about discipline and structure. The method itself is straightforward — fix one element, vary the rest, move on — but applying it consistently under exam pressure is what separates a complete, mark-winning answer from a scattered, incomplete one. Every spec requirement in this topic comes back to that single organising principle.
Sources and content standards
Published by Revise Right. Use the official specification reference to check the requirements for your course. Content updated: 2026-03-21.
Systematic listing strategies record every possible outcome in a fixed, logical order, such as alphabetical or numerical, usually by fixing one element and varying the others. This prevents both repetition and gaps, and the product rule can then check the total count.
What is systematic listing?
Systematic listing is recording all possible outcomes in a fixed, logical order, typically alphabetical, numerical, or by fixing one element and varying the others, so that every outcome appears exactly once. This structure prevents both repetition and gaps.
How many ways can you arrange 3 letters?
There are 6 ways to arrange the letters A, B and C: ABC, ACB, BAC, BCA, CAB and CBA. There are 3 choices for position 1, then 2 choices for position 2, then 1 for position 3, so 3 × 2 × 1 = 6.
What is the difference between a combination and an arrangement?
In a combination, order does not matter, so choosing pizza and salad is the same as choosing salad and pizza. In an arrangement, order matters, so AB is not the same as BA. Arranging A, B and C gives 6 arrangements.
How do you list all combinations without repeats?
Combinations are listed without repeats by fixing the first item and pairing it only with items that come after it in a fixed order. Choosing 2 flavours from Vanilla, Chocolate and Strawberry this way gives VC, VS and CS: 3 combinations.
How many two-digit numbers can be made from 1, 3 and 5?
Six two-digit numbers can be made from the digits 1, 3 and 5 using two different digits: 13, 15, 31, 35, 51 and 53. Fixing the tens digit and varying the units digit lists them, and 3 × 2 = 6 confirms the count.
How many meal combinations are there with 3 sandwiches and 2 drinks?
There are 6 meal combinations with 3 sandwiches and 2 drinks, because the product rule gives 3 × 2 = 6. Listing them by fixing each sandwich and varying the drink gives Tuna, Egg and Cheese each with Orange juice or Water.
How do you check a systematic list is complete?
A systematic list is checked by matching its count against the product rule total. If the list does not match the product rule, an outcome has been missed or a duplicate written; for example, 3 choices then 2 choices must give 6 outcomes.
What is an arrangement in maths?
An arrangement is an ordered selection, where order matters, so AB is not the same as BA. Arrangements are listed by fixing the first position and listing all choices for the rest, giving ABC, ACB, BAC, BCA, CAB and CBA for three letters.
What is a combination in maths?
A combination is a selection where order does not matter, so choosing pizza and salad is the same as choosing salad and pizza. For example, choosing 2 of 3 ice cream flavours gives just 3 combinations: VC, VS and CS.
How do you answer a list all possible outcomes question?
A 'list all possible outcomes' question is answered by writing outcomes in a clear, ordered format, row by row, fixing one element at a time. Marks are split between method and accuracy, so a disorganised scattering of outcomes risks losing method marks even if correct.