Did you know that two perfectly drawn probability trees can produce different answers for what appears to be the same bag of counters? One tree may assume a counter goes back into the bag; another may assume it stays out. The arithmetic can look neat in both diagrams. Yet only one describes the actual experiment. Understanding probability begins with the story, the changing sample space and the meaning of the branches, not with a formula memorised in isolation.
This independent eduKateSG Ministry of Education V3.0 Reference 356 develops the 2027 SEC G3 Mathematics K310 probability outcomes: single events, simple combined events, possibility and tree diagrams, addition and multiplication of probabilities, mutually exclusive events and independent events. It provides twenty-six original worked examples, a twelve-stage Solve–Check–Transfer method, a fictional classroom investigation, targeted error repairs, parent and tutor questions and independent revision work.
Every counter bag, coin, spinner, class survey and decimal in this guide is an invented mathematical teaching example. Results from idealised fair dice or coins are not claims about real-world predictive certainty. This is not an official SEAB examination paper or marking scheme; the definitive syllabus and assessment requirements come from the current Singapore Examinations and Assessment Board documents. The teaching approach follows a first-principles, small-group diagnostic model without altering the Clementi reference.
Study route for busy learners
- Write the experiment and distinguish order, fair outcomes and replacement.
- Draw a sample space, possibility grid or probability tree that models the actual situation.
- Multiply along paths, add qualifying paths, and correct for overlapping event descriptions.
- Check that the result is between zero and one and the full path probabilities total one.
- Test the concept on an unfamiliar bag or experiment without copying the numbers.
1. The official K310 scope: what probability knowledge must transfer
The 2027 G3 Mathematics K310 syllabus includes probability as a measure of chance, enumeration of outcomes in simple situations, combined events with diagrams where appropriate, and the addition and multiplication of probabilities for mutually exclusive and independent events. These outcomes are not separate tricks. Listing outcomes reveals the denominator; diagrams organise combinations; addition handles relevant alternatives with overlaps considered; multiplication represents conjunctions under clearly stated conditions. Students must select and justify the right representation, rather than applying a rule because the question contains the word ‘and’.
2. Start by defining the random experiment
An experiment describes what happens and which outcomes are possible. ‘Pick a counter’ is incomplete if a second pick follows. Are the colours equally represented? Is the first counter replaced? Is order recorded? Can the same item be chosen twice? A pupil who answers those questions before calculating already avoids many examination mistakes. Write the experiment in one sentence and name the events of interest. All later fractions should be traceable back to that sentence.
3. Probability ranges from zero to one
A probability of zero represents an impossible outcome in the stated model; one represents certainty. A value below zero or above one signals incorrect arithmetic, an invalid interpretation or faulty assumptions. A probability of 0.3 corresponds to 30% when converted, but the label does not guarantee exactly three successes in every set of ten independent trials. Mathematical probability describes likelihood under the model, not a promise about a short run of actual observations.
4. A sample space gives the denominator meaning
For one fair six-sided die, the sample space is {1,2,3,4,5,6}. For two ordered fair tosses, the space is HH, HT, TH and TT. The order matters when the event concerns first and second outcomes. If outcomes are equally likely, probability is favourable outcomes divided by all possible outcomes. If they are not equally likely, counting outcomes equally becomes invalid and the calculation must use actual stated probabilities.
5. Ordered outcomes and unordered descriptions are not interchangeable
Two different dice showing 2 and 5 or 5 and 2 are distinct ordered outcomes of the same total, even though both add to seven. Likewise, drawing red then blue is a different branch from drawing blue then red. A phrase such as ‘one red and one blue’ often requires both branches. Teach pupils to sketch the two sequences before adding. If the task explicitly ignores order, explain how the grouping changes the count without silently changing the underlying chance model.
6. Single-event probabilities are the foundation
Suppose a hypothetical bag holds three red and two blue counters, with equally likely selection. The chance of red on one draw is 3/5; blue is 2/5. The two outcomes exhaust the possible colours, so they sum to one. This complement relationship becomes a useful error check when trees grow larger. A denominator must reflect the number of eligible outcomes at the point of selection, not the total number originally drawn on the worksheet.
7. Branches represent conditional situations
On a two-stage tree, the first branch describes the first selection. Each second-stage branch represents a new situation given that the first event occurred. With replacement, the bag returns to its original composition; without replacement, it changes. Draw branches from every first outcome and write the updated count at that node. The denominator is not mechanically copied from the previous stage. A diagram is a model of a process, not just a decorative arrangement of fractions.
8. Multiply along a complete path
For independent draws with replacement, the probability of red then red from a 3-red, 2-blue bag is 3/5 × 3/5 = 9/25. Without replacement, it is 3/5 × 2/4 = 3/10. Each multiplication represents a joint sequence. The second factor should match the conditions after the first outcome. An unexplained product of two numbers may receive a correct answer by luck, but it does not show that the learner understood the story.
9. Add the paths that satisfy an event
An event described as ‘exactly one red in two draws’ can occur red–blue or blue–red. Those are distinct complete paths that cannot both describe one two-draw trial, so their probabilities are added. With replacement from a 3-red, 2-blue bag, the answer is (3/5 × 2/5) + (2/5 × 3/5) = 12/25. Writing only red then blue produces half of the intended event in this symmetric model. In an asymmetrical experiment, the two path values need not be equal.
10. Mutually exclusive describes one experiment’s events
Two events are mutually exclusive if they cannot occur together in the same trial. A fair die showing an odd number and showing an even number are mutually exclusive on a single roll. If A and B are mutually exclusive, P(A or B) = P(A) + P(B). The key is the intersection being empty, not the events feeling unrelated. Pupils should identify the shared sample space before calling two event descriptions mutually exclusive.
11. Independent describes whether one event changes the other
Two events are independent when knowing one occurs does not alter the probability of the other, under the model. Separate fair coin tosses are a standard classroom example. Independence is not the same as mutual exclusivity: two nonzero mutually exclusive events cannot be independent, since their joint probability is zero while the product of their positive probabilities is not. Ask students to test the definition, not use either word as a synonym for ‘different’.
12. Overlap changes the addition rule
If A and B can happen together, simply adding P(A) and P(B) counts their overlap twice. The general relationship is P(A or B) = P(A) + P(B) − P(A and B). In a fair deck, ‘heart’ is contained within ‘red’, so the probability of heart or red is the probability of red, not the sum of heart and red. This set reasoning is useful even when only the mutually exclusive special case is explicitly assessed.
13. Complements simplify ‘at least one’ questions
For two independent fair tosses, the event ‘at least one head’ includes HH, HT and TH. It may be easier to calculate one minus the chance of no heads: 1 − (1/2 × 1/2) = 3/4. A complement is valid only when the two descriptions cover every outcome without overlap. ‘Not exactly one head’ is different from ‘no heads’ because it includes zero or two heads. Translate the English precisely before subtracting.
14. Replacement is a change to the sample space, not to the colour labels
When a counter is replaced, the second draw occurs from the original composition. Without replacement, the second denominator decreases by one and the favourable colour count changes if that colour was drawn. The first-stage probability is the same under both models, but later branches differ. In teaching, show the two trees side by side and insist the pupil explain the physical operation that justifies each denominator.
15. Equal-likelihood assumptions must be stated
A spinner divided into four geometrically equal sectors may be modelled as four equally likely outcomes if it is fair. Four differently sized sectors cannot be assumed equally likely merely because the picture shows four colours. An experiment may provide probabilities directly instead of counts. Students should identify the given premise and not replace empirical or weighted probabilities with 1/n simply because there are n labels.
16. A possibility diagram is useful when there are many pairings
Two fair dice produce a six-by-six grid of ordered pairs. Shade the cells matching a sum or difference, count them, and divide by 36. The diagram makes repeated combinations visible and catches omissions such as counting only 1+6 but not 6+1. A tree works too, but the grid is often faster for two-stage equal-outcome experiments. Choose the representation that reveals the structure with the least opportunity for error.
17. Tree diagrams should total one
If every mutually exclusive complete path of a simple probability tree is included, their probabilities sum to one. For the 3-red, 2-blue bag without replacement, the paths RR, RB, BR and BB have probabilities 3/10, 3/10, 3/10 and 1/10. Their sum is 1. This check can reveal a forgotten branch or an incorrect second-stage count. Passing the sum check is necessary but not sufficient: two wrong values might accidentally compensate.
18. Do not confuse expected frequency with certainty
If a stated independent event has probability 1/4 and is repeated 100 times, its expected number of successes is 25 in the ideal model. There is no guarantee of exactly 25. Actual observations may vary, especially in small samples. Make clear whether a task asks for probability, expected frequency or an observed relative frequency. These are related concepts but answer different questions.
19. Avoid arithmetic shortcuts that erase assumptions
The phrase ‘multiply for and, add for or’ is incomplete. Multiplication may need a conditional probability; addition may need subtraction of overlap. A better short guide is: define the event, draw or list the mutually exclusive paths, multiply the appropriate branch probabilities along each path, and add the valid paths. This method justifies the calculation and works across a wider range of wordings.
20. Units and interpretations still matter in pure probability
Probability itself has no physical unit; the quantities that define a real task may have units. If a question discusses pupils, books or bus arrivals, the counted outcomes must refer to the same event and sampling frame. An event probability computed for one class must not silently be described as a probability for every Singapore school. Be precise about whether the denominator is all students, selected students, draws or trials.
21. Use conditional notation only when it clarifies
P(B given A) names the probability of B in the situation where A has occurred. In the two-red-after-one-red example, a second red has probability 2/4, not 3/5. Pupils need not memorise advanced notation before understanding the bag. Begin with words, demonstrate the revised sample space, then show any notation that makes the relationship clearer. The explanation should remain accessible at the assessed level.
22. Algebra can verify a simple model
Suppose a two-outcome event has probability p of success on each independent trial. Two successes have probability p²; exactly one success has probability 2p(1−p); no successes have probability (1−p)². The three expressions add to one. This extension shows why a complete tree is internally consistent. It is not a substitute for first checking whether the trials are independent.
23. The question’s command words decide the final event
‘Both’, ‘either’, ‘exactly one’, ‘at least one’, ‘neither’ and ‘only the second’ define different sets of paths. Under two fair tosses, ‘both heads’ is 1/4, ‘exactly one head’ is 1/2 and ‘at least one head’ is 3/4. A pupil who immediately multiplies numbers without translating the command word may answer the wrong question expertly. Have them underline the event phrase and say it in their own words.
24. The standard of mastery is an unseen case with a stated assumption
A learner who copies a two-coin tree may still fail a question involving counters without replacement or an overlapping union of events. Transfer practice changes the number of outcomes, the order requirement and the replacement rule. Ask for an explanation of why a branch denominator has changed and how the final answer was checked. The goal is independent interpretation, not speed at drawing familiar diagrams.
25. Twelve-stage Experiment–Model–Check protocol
Stage 1 — Describe the experiment
Record the number of trials, objects, outcomes, and whether order is observed.
Stage 2 — Identify the event
Translate words such as both, at least one, exactly one or neither into outcomes.
Stage 3 — Check fairness and likelihood
Decide whether outcomes are equally likely or whether explicit probabilities are supplied.
Stage 4 — Check replacement and dependence
State whether early outcomes change later probabilities; never assume independence.
Stage 5 — List a small sample space
Draw a simple list before using a diagram when only a few outcomes exist.
Stage 6 — Select a helpful model
Choose a possibility grid, tree or table because it reveals the paths.
Stage 7 — Label every branch
Include the correct numerator, current denominator and conditional situation.
Stage 8 — Multiply within one path
Use branch products for the complete sequential outcome.
Stage 9 — Add qualifying distinct paths
Count every route satisfying the question; avoid double-counting overlap.
Stage 10 — Check the complement
Use the remaining outcomes to test whether the requested event was defined correctly.
Stage 11 — Validate the mathematics
Check the answer lies between zero and one; check complete paths total one.
Stage 12 — Transfer and explain
Change a condition and ask the pupil which parts of the tree must change, and why.
26. The fictional Crescent Bay probability laboratory
Three fictional G3 pupils are studying chance at an imagined Singapore learning table. They use paper counter-bag diagrams and verified mathematical models rather than observing actual experiments with unknown physical biases. One pupil defines the sample space, one draws paths and multiplies fractions, and the third checks independence, wording and complements. They rotate responsibilities, then solve independently with new objects and quantities. An observer records whether each pupil explains the conditional denominator, not whether the group merely arrives at a correct answer.
27. Twenty-six worked examples with checks
Worked Example A. One fair die, an even outcome
Even outcomes are 2, 4 and 6 among six equally likely faces. P(even) = 3/6 = 1/2. The event is a single roll, not a sequence. The denominator six comes from the sample space, not from the largest face value by coincidence. Verify odd outcomes form the complement, also 1/2.
Worked Example B. Prime number on a fair die
The prime faces are 2, 3 and 5; 1 is not prime. There are three favourable faces out of six, giving P(prime) = 1/2. Listing them explicitly prevents a common error in which pupils include 1. The case illustrates the difference between mathematical meaning and a familiar-looking number category.
Worked Example C. Two fair coin tosses, exactly one head
List HH, HT, TH and TT. Exactly one head occurs on HT and TH, so P(exactly one head) = 2/4 = 1/2. HT and TH must both be included because the event allows either order. The diagram is also a check that all four equally likely sequences were accounted for.
Worked Example D. Two fair coin tosses, at least one head
Only TT has no heads. Subtract its probability from one: 1 − 1/4 = 3/4. Listing HH, HT and TH confirms the result. ‘At least one’ is not ‘exactly one’; the HH path is included. A student who obtains 1/2 has probably omitted the two-head outcome.
Worked Example E. Two dice, total seven
There are 36 ordered outcomes for two independent fair six-sided dice. The pairs (1,6), (2,5), (3,4), (4,3), (5,2) and (6,1) sum to seven, so P(total seven) = 6/36 = 1/6. A six-by-six grid makes the reverse-order pairs visible.
Worked Example F. Two dice, equal faces
Double outcomes are (1,1) through (6,6), six among 36 equally likely ordered outcomes. P(equal faces) = 6/36 = 1/6. Equal values are not a single outcome; there are six possible matching faces. The count should come from a clear diagram or list, not a guess based on the word ‘same’.
Worked Example G. Bag of three red and two blue, one red
There are five equally likely counters; three are red. P(red) = 3/5 and P(blue) = 2/5. These complementary events sum to one. On a one-stage draw, replacement does not affect the first probability. If a second draw is mentioned, the story needs another explicit assumption.
Worked Example H. Red then red, with replacement
The bag contains three red and two blue counters; the first counter is returned before the second draw. P(RR) = 3/5 × 3/5 = 9/25. The second fraction remains 3/5 precisely because replacement restores the original bag. State this rather than simply writing a repeated numerator.
Worked Example I. Red then red, without replacement
From three red and two blue counters, P(RR) = 3/5 × 2/4 = 6/20 = 3/10. After a red first draw, four counters remain, two red. The answer is not 9/25; the second chance changes. A physical counter demonstration is unnecessary if the updated bag is drawn clearly on paper.
Worked Example J. Red then blue, without replacement
With the same bag, P(RB) = 3/5 × 2/4 = 3/10. A first red removes one red, leaving two blue among four counters. The second numerator remains two, while the denominator decreases. A pupil should describe what remains, not alter both numbers mechanically.
Worked Example K. Exactly one red without replacement
Exactly one red occurs on RB or BR. RB = 3/5 × 2/4 = 3/10 and BR = 2/5 × 3/4 = 3/10, so the total is 3/5. The two sequences are distinct complete outcomes. The answer is an addition of two branch products, not a new unexplained product.
Worked Example L. Both blue without replacement
From the 3-red, 2-blue bag, P(BB) = 2/5 × 1/4 = 1/10. The first blue leaves just one blue among four counters. This path completes the four-path tree. Together RR = 3/10, RB = 3/10, BR = 3/10 and BB = 1/10 sum to exactly one.
Worked Example M. Exactly one red with replacement
With replacement, P(RB) = 3/5 × 2/5 = 6/25 and P(BR) = 2/5 × 3/5 = 6/25. Therefore P(exactly one red) = 12/25. The result differs from 3/5 without replacement, despite using the same original bag. The change comes from the experimental rule.
Worked Example N. Odd and even on one fair die
Odd and even are mutually exclusive because one die result cannot be both. Their probabilities are each 1/2, while P(odd and even) = 0. They are not independent: 1/2 × 1/2 is not zero. This example directly separates mutually exclusive from independent instead of repeating definitions.
Worked Example O. Independent blue and gold spinners
A fair spinner has one blue sector among four, and an independent fair spinner has one gold sector among five. P(blue and gold) = 1/4 × 1/5 = 1/20. The multiplication is justified by independence, not by the colours. An uneven spinner would need different stated probabilities.
Worked Example P. A union with overlap
Suppose P(A) = 0.6, P(B) = 0.5 and P(A and B) = 0.2 for a consistent hypothetical model. P(A or B) = 0.6 + 0.5 − 0.2 = 0.9. Adding without subtracting gives 1.1, an invalid probability. The overlap correction prevents double counting.
Worked Example Q. Heart or red from a standard deck
There are 26 red cards in a 52-card standard deck, and every heart is red. The event ‘heart or red’ therefore includes the 26 red cards, giving 26/52 = 1/2. Adding 13/52 to 26/52 without subtracting the overlapping hearts would count them twice.
Worked Example R. Three independent attempts, no success
Each independent attempt has success probability 0.2 in a fictional model. Failure probability is 0.8, so P(no successes in three) = 0.8³ = 0.512. This uses independence at each stage and should not be applied to repeated attempts whose probabilities change with experience or conditions.
Worked Example S. Three attempts, at least one success
Using the same idealised independent model, P(at least one success) = 1 − P(no successes) = 1 − 0.512 = 0.488. The complement approach avoids listing seven success-containing paths. It is still essential to state the independence assumption that produced 0.512.
Worked Example T. Two attempts, exactly one success
Each independent attempt succeeds with probability 1/4. Exactly one success is success–failure or failure–success: (1/4 × 3/4) + (3/4 × 1/4) = 6/16 = 3/8. The two pathways are disjoint. Do not confuse the answer with one success on a particular named attempt, which is only 3/16.
Worked Example U. Two red from seven red and three blue
Ten counters are in a bag; two are drawn without replacement. P(RR) = 7/10 × 6/9 = 42/90 = 7/15. The denominator decreases to nine because one counter has been removed; the red count decreases to six following a red draw. Check both changes.
Worked Example V. Second counter red, given first red
In the original three-red, two-blue bag without replacement, the chance the second draw is red given the first was red is 2/4 = 1/2. This is not the same as P(two reds) = 3/10, because the condition has already happened. Name the condition whenever an answer uses a second-stage branch.
Worked Example W. Three tosses, at most one head
For three independent fair coin tosses, all eight ordered sequences are equally likely. No heads occurs once; exactly one head occurs three times. The favourable total is four, so P(at most one head) = 4/8 = 1/2. ‘At most’ includes zero. A list makes the language unambiguous.
Worked Example X. Two independent events, union
If P(A) = 0.4 and P(B) = 0.3 and A and B are independent, their intersection is 0.4 × 0.3 = 0.12. Their union is 0.4 + 0.3 − 0.12 = 0.58. Independence does not let us simply add probabilities. The joint event must be accounted for.
Worked Example Y. A fair spinner with unequal event sizes
An idealised spinner has eight equal sectors: five labelled ‘star’ and three labelled ‘circle’. P(star) = 5/8, not 1/2 just because there are two labels. The outcomes counted as equally likely are physical sectors, not the category names. If sector areas are unequal, further probability information would be required.
Worked Example Z. Independent transfer from a changed bag
A new fictional bag holds four yellow and one green counter. Without replacement, P(two yellow) = 4/5 × 3/4 = 3/5. With replacement the answer becomes 4/5 × 4/5 = 16/25. The learner must explain which second-stage branch changed and why, rather than simply choosing the answer that resembles the earlier red-counter example.
28. Ten recurring errors and exact repairs
1. Adding two probabilities when the events overlap
Find the joint outcomes first, subtract overlap once and verify the resulting value is no greater than one.
2. Calling mutually exclusive events independent
Test whether an event can occur with the other and whether the joint probability matches the product.
3. Copying the first fraction after no replacement
Recount what remains after each branch, including numerator and denominator.
4. Counting only one order for exactly one
Include RB and BR or HT and TH where both satisfy the wording.
5. Treating at least one as exactly one
Include every path with one or more successes, or use the complement of none.
6. Assuming labelled outcomes are equally likely
Check fair sectors, weights or supplied probability data before using favourable-counts divided by outcomes.
7. Forgetting units of the experiment
A sample space of students cannot be combined with a denominator of classes without a valid model.
8. Using frequency as a guarantee
Expected number of successes in repeated trials is not an exact prediction for each sequence.
9. Drawing a tree without all its paths
Complete both branches at every node, then check complete path probabilities total one.
10. Giving a fraction without explaining the rule
State whether you multiply along a sequential path, add disjoint paths or subtract an overlap.
29. Three-pupil small-group tutorial
Pupil A draws the experiment and highlights the phrase ‘without replacement’ or ‘exactly one’. Pupil B computes complete paths using the numbers at each branch. Pupil C independently audits overlap, missing paths and whether any answer exceeds one. The tutor checks the earliest incorrect mental move. If a student retains a denominator of five after removing a counter, repair that conditional sample space before assigning ten more tree questions. Rotate the roles and use a fresh bag, coin or spinner problem for independent transfer. Never confuse listening to a peer with being able to solve alone.
30. Depth–Load–Transfer diagnostic
Depth asks the student to explain in ordinary language why a second-stage probability changes without replacement and why mutually exclusive does not mean independent. Load asks the student to manage four paths, fractions, event wording and complements in one working solution. Transfer changes the number of colours, the order requirement or the dependence rule without announcing which formula to use. Categorise errors as event interpretation, sample space, branch update, multiplication, path union, overlap or checking. Repair one underlying issue at a time and confirm improvement through a new unseen case.
31. Parent and tutor prompts
Useful questions are ‘What exactly happens in this experiment?’, ‘Can you list the possible outcomes?’, ‘Does the first action change what remains?’, ‘Which paths satisfy exactly one?’, ‘Could two named events happen together?’, and ‘How can you confirm your answer?’ Do not praise speed at the expense of reasoning. A pupil who hesitates but can reconstruct an accurate tree is building more transferable mathematical judgement than a pupil who memorises an unreliable shortcut.
32. Independent practice and answer checks
Practice 1 — Without-replacement transfer
A bag has four orange and three violet counters. Find P(orange then violet) without replacement: 4/7 × 3/6 = 2/7. Explain both denominators.
Practice 2 — With-replacement contrast
For the same bag find P(orange then violet) with replacement: 4/7 × 3/7 = 12/49. Name the changed assumption.
Practice 3 — Exactly one in two tosses
List the four ordered outcomes of two fair coin tosses; exactly one head occurs twice, so the answer is 1/2.
Practice 4 — Complement route
For three independent trials with success probability 1/5, find at least one success as 1 − (4/5)³ = 61/125.
Practice 5 — Independent union
If A and B are independent with chances 1/2 and 1/3, calculate both 1/6, then union 1/2 + 1/3 − 1/6 = 2/3.
Practice 6 — Mutual exclusion test
Explain why odd and even on a single fair die cannot both occur, and why this does not make them independent.
Practice 7 — Possibility grid
Make a 6-by-6 ordered-dice grid; count the six ways of obtaining seven to produce 1/6.
Practice 8 — Bad tree repair
A second branch after drawing one blue without replacement from two blue and three red is incorrectly labelled 2/5. Correct it to 1/4 and explain.
Practice 9 — Event wording
In three fair tosses, compare at most one head (4/8) with at least one head (7/8). Describe the sets before computing.
Practice 10 — Independent new context
Write an original two-stage chance experiment and ask a peer to explain whether its second stage is dependent, then justify a complete-tree sum of one.
33. Frequently asked questions
What probability topics are included in the 2027 G3 Mathematics K310 syllabus?
The probability section covers chance, single events, simple combined events and their representations, and addition or multiplication principles for mutually exclusive and independent events. The current official syllabus document is authoritative.
When do I multiply probabilities?
Multiply along a specific complete path, using the correct probability at each stage. For independent events this can be the simple product of unchanged probabilities; for dependent stages use updated conditional chances.
When do I add probabilities?
Add probabilities of distinct mutually exclusive outcomes that satisfy the question. When event descriptions overlap, subtract the overlap once using the appropriate union reasoning.
What is the difference between mutually exclusive and independent?
Mutually exclusive events cannot occur together in one trial. Independent events do not change one another’s likelihood. Two nonzero mutually exclusive events cannot also be independent.
Why does drawing without replacement change the second fraction?
The first selected item is removed, altering the remaining number of possible and favourable items. The second denominator decreases and its numerator depends on the first outcome.
Does at least one mean exactly one?
No. At least one includes one, two or more where those outcomes are possible. Exactly one excludes cases with multiple successes.
How do I check a probability tree?
Every branch from a node should describe its possible next outcomes and sum to one. Every complete path should have a valid probability, and the disjoint complete paths together should sum to one.
Do expected successes always happen?
No. Expected frequency is an average property of a model across repeated trials, not a guarantee for a particular set of outcomes.
How can a parent help without giving away the answer?
Ask what the experiment is, whether order matters, what happens after the first outcome, which paths answer the question and how the learner checked the result.
Is this an official exam paper?
No. It is an independent eduKateSG explanatory reference using invented worked examples. Consult SEAB and the school for current assessment conditions and actual syllabus boundaries.
34. Closing principle
Probability is structured reasoning about possibilities. Define the experiment, build the right sample space, trace what happens after each event, count every qualifying path and check the mathematical story. The student’s achievement is not a perfect drawing of a familiar tree; it is explaining an unfamiliar scenario correctly under a new condition. That is why diagnostic feedback, targeted practice and independent transfer are central to a strong Mathematics education.
Official syllabus and connected eduKateSG references
SEAB 2027 G3 Mathematics K310 syllabus directory; Reference 343 — Standard Deviation and Spread; Mathematics Learning Hub; MOE V3.0 reference library; immutable Clementi small-group Mathematics teaching reference.