A canteen sells three fruit choices and two drink choices.
How many different fruit-and-drink combinations are possible?
A learner writes:
- apple with water;
- banana with milk;
- orange with water;
- apple with milk;
- orange with milk.
Five combinations are on the page.
But is five the answer?
Not yet.
The missing question is: how do we know no case was forgotten?
Systematic listing is not merely writing possibilities down. It is choosing an order that generates every valid case once, exposes duplicates and makes completeness checkable.
The quick answer: organise one variable while holding another fixed
List all drinks for apple:
- apple + water;
- apple + milk.
Then all drinks for banana:
- banana + water;
- banana + milk.
Then all drinks for orange:
- orange + water;
- orange + milk.
Now six combinations are visible.
More importantly, the structure proves completeness: each of the three fruit choices has been paired with each of the two drink choices exactly once.
A list becomes mathematical when its order carries a proof
Compare two approaches.
Unstructured list: write cases as they occur to you.
Systematic list: choose a variable, move through its possible values in order, and for each value exhaust all permitted choices for the remaining variables.
The second approach does two jobs at once:
- it finds the cases;
- it explains why the search is complete.
Worked example: two-digit numbers from given digits
Using the digits 2, 5 and 7 without repetition, how many two-digit numbers can be formed?
Fix the tens digit first.
Tens digit 2:
- 25;
- 27.
Tens digit 5:
- 52;
- 57.
Tens digit 7:
- 72;
- 75.
There are 6 numbers.
The listing is complete because every permitted tens digit has been used and every remaining permitted ones digit has been paired with it.
Constraints should be applied as early as possible
Suppose the same problem adds a condition: the number must be greater than 50.
Do not generate all six cases and then cross out half unless that is useful for teaching.
The tens digit must now be 5 or 7.
- 52, 57;
- 72, 75.
Four cases remain.
A strong listing strategy uses constraints to shrink the tree before unnecessary branches are created.
Worked example: coin combinations
How many ways can $1 be made using only 20-cent and 50-cent coins, if at least one coin of each type must be used?
Let the number of 50-cent coins increase systematically.
One 50-cent coin leaves 50 cents. That remainder is not divisible by 20, so no valid case.
Two 50-cent coins already make $1, but then no 20-cent coin is used, violating the condition.
Therefore there are no valid combinations.
This example is useful because systematic listing is not guaranteed to produce a positive count. It can prove that a constrained solution does not exist.
Worked example: a target sum
Two whole numbers a and b satisfy a + b = 12, with a < b and both positive. List all possible pairs.
Start with the smallest possible a.
| a | b | Valid? |
|---|---|---|
| 1 | 11 | yes |
| 2 | 10 | yes |
| 3 | 9 | yes |
| 4 | 8 | yes |
| 5 | 7 | yes |
| 6 | 6 | no: a is not less than b |
Once a reaches 6, the pairs begin to reverse: 7+5, 8+4 and so on. Those are not new unordered pairs.
So there are 5 valid pairs.
Know whether order matters
This is one of the most common sources of duplication.
If choosing a class captain and vice-captain, Alice–Ben and Ben–Alice are different outcomes because the roles differ.
If choosing a two-person team with no roles, Alice–Ben and Ben–Alice describe the same team.
Before listing, ask:
Does changing the order create a genuinely different outcome?
Tree diagrams are systematic lists with visible branches
A tree diagram is useful when choices happen in stages.
For example, a student chooses one shirt from red or blue, then one pair of trousers from black, grey or white.
Branch red into three trouser choices. Branch blue into the same three.
The six leaves are the six combinations.
A tree is not a different principle. It is a spatially organised listing system.
Tables are better when two variables form a grid
If every value of one variable can pair with every value of another, a two-way table may be cleaner than a long list.
Rows can represent the first choice. Columns can represent the second. Each cell represents one case.
This makes omissions and duplicates visually easier to detect.
When systematic listing is a strong strategy
- The number of possible cases is manageable.
- The answer depends on satisfying several discrete conditions.
- Order may or may not matter and must be tracked carefully.
- The problem asks “how many ways”, “which possible values” or “list all cases”.
- A pattern in the cases may become visible only after they are organised.
- The learner needs to prove completeness rather than merely find one solution.
When systematic listing becomes inefficient
Listing 6 cases is sensible.
Listing 6,000 cases is usually not.
As the number of possibilities grows, counting principles, algebra, probability rules or computational methods may compress the search.
Systematic listing is therefore both a solution method and a diagnostic bridge toward more formal combinatorics.
Common misconception 1: neat handwriting makes a list systematic
Neatness helps, but order must encode the search.
Repair: state what is being held fixed and what is changing.
Common misconception 2: stop when enough cases have been found
A problem asking for all possibilities needs a completeness argument.
Repair: identify the final possible value of the controlled variable and explain why nothing beyond it is valid.
Common misconception 3: reversed order is always a new case
That depends on the problem.
Repair: decide whether outcomes are ordered or unordered before listing.
Common misconception 4: invalid cases should be mixed into the list without explanation
Crossing out can be useful, but the reason for rejection should be visible.
Repair: use a condition column or apply the constraint earlier.
A diagnostic ladder
- Can the learner state the variables that can change?
- Can the learner identify the possible values of each variable?
- Can the learner hold one variable fixed while cycling through another?
- Can the learner decide whether order matters?
- Can the learner apply constraints consistently?
- Can the learner detect duplicate cases?
- Can the learner recognise a natural stopping point?
- Can the learner explain why every remaining case is impossible or already represented?
- Can the learner switch to a table or tree when that representation is clearer?
- Can the learner recognise when the search is too large and another method is needed?
How this fits Singapore Primary and PSLE Mathematics
The current MOE Primary Mathematics syllabus places problem solving at the centre of the subject. Systematic listing is best treated as a general heuristic that draws on number, algebraic relationships, data organisation and logical constraint rather than as a standalone content strand.
The 2026 PSLE Mathematics assessment objectives include interpreting and analysing information, making inferences and selecting appropriate strategies. A systematic list demonstrates those behaviours particularly well because the learner must organise information and justify that the search is complete.
What parents should listen for
- “I fixed the first choice and listed every second choice.”
- “These two cases are the same because order does not matter here.”
- “Once a reaches 6, the pairs repeat in reverse.”
- “This branch cannot work because it breaks the total.”
- “I know I am finished because every permitted value has been exhausted.”
The deeper lesson: completeness is part of the answer
Finding one case proves existence.
Finding several cases proves very little about the cases you did not write.
A systematic list is powerful because its structure turns absence into evidence.
The strongest list does not merely show what is possible. It makes it difficult for a missing possibility to hide.