Wait, What? Some Problems Need Branches, Not One Straight Route
Primary 6 students are often trained to expect a single chain of steps. But some non-routine problems contain alternatives: a number may be odd or even, an arrangement may begin in more than one way, a condition may produce different consequences, or several possible cases must be tested before one survives.
This guide develops case splitting and decision-tree thinking. The aim is to organise branching possibilities systematically so that every relevant path is considered, impossible branches are eliminated early and no valid case is counted twice or forgotten.
A decision tree is a map of conditional reasoning: if this case holds, follow these consequences; if not, move to the next branch.
Quick Answer
A reliable branching routine is:
IDENTIFY THE CHOICE POINT → DEFINE MUTUALLY EXCLUSIVE CASES → APPLY CONDITIONS WITHIN EACH CASE → ELIMINATE IMPOSSIBLE BRANCHES → CONTINUE VALID BRANCHES → CHECK COVERAGE → INTERPRET THE SURVIVORS.
1. What Is a Case?
A case is one distinct possibility that changes the reasoning path. Examples include “the unknown is even” versus “the unknown is odd,” “the first choice is A” versus “the first choice is B,” or “the angle is acute” versus “the angle is obtuse” when those possibilities lead to different consequences.
Case splitting is useful only when the branches are mathematically meaningful.
2. Cases Should Be Mutually Exclusive Where Possible
Mutually exclusive cases do not overlap. A whole number is either even or odd; it cannot be both. This clean split prevents double counting.
When cases overlap, state the overlap explicitly or reorganise the split.
3. Cases Should Cover the Whole Possibility Space
A split is useful only if every valid answer belongs to at least one branch. “Less than 10” and “greater than 10” misses the case exactly equal to 10.
Completeness requires checking boundaries.
4. A Decision Tree Makes Sequential Choices Visible
Suppose a two-step process chooses one of two colours and then one of three shapes. A decision tree branches first by colour, then each colour branch splits by shape. The leaves show all combinations.
The tree externalises the structure and prevents missing combinations.
5. Worked Example: Two-Digit Numbers
Form two-digit numbers from digits 1, 2 and 3 without repetition.
- If tens digit = 1, ones digit can be 2 or 3: 12, 13.
- If tens digit = 2, ones digit can be 1 or 3: 21, 23.
- If tens digit = 3, ones digit can be 1 or 2: 31, 32.
The three first-level cases cover all possible tens digits, and each second-level branch covers the remaining valid ones digit.
6. Branch Early on the Most Restrictive Condition
If one condition removes many possibilities, use it near the top of the tree. For example, if a number must be even, branch by possible final digits before testing a weaker condition such as digit sum.
Good branch order reduces work.
7. Eliminate Impossible Branches Immediately
If a branch produces a negative number of objects, exceeds a total, violates a ratio or breaks a whole-number condition, stop that branch. Do not continue calculations inside an impossible state.
Early pruning is one of the main advantages of decision-tree reasoning.
8. Worked Example: Ticket Cases
Eight tickets are bought, adult tickets cost $10 and child tickets cost $6, and total cost is $64. One case split is by number of adult tickets: 0,1,2,…,8. Each branch determines the number of child tickets and total cost.
Because replacing one child ticket with one adult ticket raises cost by $4, many branches can be pruned or skipped once the pattern is recognised. The valid branch is 4 adults and 4 children.
9. Case Splitting and Systematic Listing Are Closely Related
A systematic list is often a flattened decision tree. A decision tree is more useful when later choices depend on earlier choices. A list is more compact when every case has the same simple structure.
Choose the representation that makes completeness easiest to see.
10. Case Splitting in Geometry
Some geometry questions may require considering whether a point lies inside or outside a region, whether a construction uses one orientation or another, or whether a dimension satisfies different constraints. Each branch must preserve the stated geometric properties.
Do not invent cases merely because a diagram could be imagined differently; cases must arise from the problem’s actual conditions.
11. Case Splitting in Number Problems
Parity, divisibility and remainder conditions naturally create cases. If a whole number must leave remainder 1 when divided by 3, candidate values can be organised by that remainder class rather than searched randomly.
Number properties define efficient branches.
12. Case Splitting in Ratio and Fraction Problems
If a transfer could occur from A to B or from B to A, the two directions form different cases because the ratio consequences differ. Track each branch independently and reject any that violate the final condition.
Direction can be a branch variable.
13. Conditional Statements Create Branches
Words such as “if,” “otherwise,” “either,” “unless,” and “depending on” often signal branch structure. Read each condition carefully before applying calculations.
A single arithmetic route may be invalid if the rule changes between cases.
14. Decision Trees Can Separate Assumptions From Facts
When the problem does not tell us which case holds, label each branch as an assumption. Then follow the consequences. A surviving branch becomes supported only after all conditions are checked.
This prevents assumed cases from silently becoming facts.
15. Branches Can Rejoin
Two different cases may later produce the same intermediate state. When that happens, the solution can merge again rather than duplicating all later work.
Recognising rejoining paths improves efficiency.
16. Stop When the Question Requires Only One Valid Case
If the task asks whether a valid arrangement exists, one valid branch may be enough. If it asks for all possible arrangements, every branch must be checked. The completeness requirement depends on the wording.
Read the quantifier: one, any, all, exactly, at least.
17. Common Error Families
| Error | What it looks like | Repair |
|---|---|---|
| Overlapping cases | Counts the same outcome in two branches | Make cases mutually exclusive |
| Incomplete split | Misses a boundary or third possibility | Check that cases cover the full space |
| Late pruning | Continues impossible branches | Apply restrictive constraints early |
| Assumption drift | Treats a branch as fact before verification | Label assumptions |
| Branch mixing | Uses data from one case inside another | Keep branches visually separate |
| Completeness mismatch | Finds one case when all are required | Read the quantifier in the question |
18. A First-Weak-Link Diagnostic
- Choice point: Can the learner identify where reasoning branches?
- Case definition: Can mutually exclusive cases be stated?
- Coverage: Can the learner show all possibilities are included?
- Constraint use: Can impossible branches be pruned early?
- Branch discipline: Can data stay within the correct case?
- Efficiency: Can the most restrictive condition be used first?
- Completeness: Can the learner tell whether one or all cases are required?
- Transfer: Can case splitting work across number, geometry and word problems?
19. Examination Control
- Branch only when cases genuinely change the route.
- Define cases so they do not overlap.
- Check boundary cases.
- Use the strongest constraint early.
- Cross out impossible branches immediately.
- Keep assumptions labelled.
- Confirm whether the question asks for one valid case or all cases.
20. What Parents Can Ask
- “Where does the problem split into different possibilities?”
- “Can both cases happen at the same time?”
- “Have you covered every possibility?”
- “Which condition can eliminate branches fastest?”
- “Why can this branch be rejected?”
- “Do you need one answer or every valid case?”
21. What Tutors Should Protect
- Case quality. Branches should reflect mathematical distinctions.
- Mutual exclusivity. Prevent double counting.
- Coverage. Require a complete partition when all cases matter.
- Pruning. Apply constraints early.
- Assumption status. Keep tentative branches labelled.
- Prompt reduction. Let learners design the split.
- Transfer. Use branching across different domains.
22. Continue the Primary 6 Mathematics Series
- Primary 6 Mathematics Learning Hub
- Selecting Relevant Information and Filtering Distractors
- Information Sufficiency and Missing Data
- Synthesis Problems and End-to-End Solution Architecture
The Quiet Return
Case splitting gives structure to conditional reasoning. Instead of mixing possibilities in one crowded solution, the learner builds separate paths, tests them and keeps only the branches that survive.
The mature Primary 6 habit is to ask: where does the logic branch, do my cases cover every possibility, and which branches can I eliminate before doing more work?
