JC2 · H2 Mathematics · Notes
Solve conditional, independent-event, region-bound, tree, counting and repeated-game probability questions with complete event setups.
Probability summary and formula sheet: every method on 3 pages
Mr Ian Ang’s summary of the whole probability chapter on three pages.
Page 1 of 3 Venn diagrams, independence and min-max
H2 Math summary notes
Probability formulas and methods, section by section
Page 1 of 3Venn diagrams, independence and min-max
Venn results: complements, unions, A or B but not both, and three events
- and , where the second is given the same set .
- For two events, .
- For A or B but not both, the probability is .
- Also and , because is split by into its inside and its outside.
- For three events, .
Conditional probability: the ratio formula, and why a tree is not read backwards
- . The words "given" and "if" make a ratio.
- Example: a pear is selected and the chance it is rotten is , so .
- A bag has 5 red and 3 blue, and two are drawn without replacement. Read straight off the branch: .
- Going the other way, .
- Warning: do not read the tree backwards. Use the formula.
Mutually exclusive or independent: two fair dice, three events
- Mutually exclusive means : ask whether they can happen together. Independent means or . Independence is not seen on a Venn diagram.
- Two fair dice: the sum is odd, the first score is at most 2, the sum is at least 9. Then , , .
- : , so independent.
- : because the sum is at most 8, so mutually exclusive.
- : but , so not independent.
Venn question with a conditional: find P(B), then P(A given B') and test independence
- Given , and .
- and .
- Then , so .
- .
- Independent? : no.
Min-max, two events: the range of P(A and B)
- is at its maximum when is at its minimum, and the reverse.
- Let , and .
- , so .
- Also , so .
Min-max, three events: fill the whole Venn diagram in x, then every region is at least 0
- Step 1: call the most intersected unknown region . Step 2: fill the whole Venn diagram in . Step 3: every region is at least .
- Given , , , , and . Let . Then .
- Fixed regions: only , only , only . Then only is and only is .
- Outside is .
- The conditions , , and give .
- If are independent, , so .
Page 2 of 3Trees, P and C, and infinite GP
Tree: stages with conditionals, and given as a ratio
- A player hits the first try with . After a hit, the next try hits with ; after a miss, with . There are three tries.
- .
- Given a miss on the second, exactly two hits in three: the only path is hit, miss, hit. and .
- So the answer is .
- Warning: "given" means a ratio, not a product.
Tree: a test that is not reliable, with P(D given positive) and P(D or positive)
- A proportion has the disease. The test is positive for of those with it and of those without.
- .
- When this is .
- "Or" on a tree: D or positive, or both. Take every path with one condition, or (the other path).
- .
Probability with P and C: ways the event can occur over total ways without restriction
- Probability is the number of ways the event can occur over the total number of ways without restriction.
- A committee of 4 from 12 women and 8 men with exactly 2 women: .
- 15 sweets: 4 caramel, 5 mint, 6 strawberry; take 3. All different: . At least two the same: .
- Exactly one strawberry and two the same: .
- Given at least two the same: .
- Warning: "and" goes in the numerator, and the given event goes in the denominator.
Identical objects: nCr is allowed in a probability because the same selections are counted above and below
- is allowed for identical objects in a probability, because the same selections are counted above and below.
- 6 identical red and identical blue blocks, 3 chosen: , so .
- Then , so and .
- is an integer, so a GC table also works.
- Factorial simplification: .
Infinite GP: taking turns, where the first six wins
- A and B roll a die in turn, A first, and the first six wins. A wins: A, A'B'A, A'B'A'B'A, and so on.
- This is . The first term is and each term is multiplied by .
- .
- B wins: .
- B wins on her second roll, given that B wins: .
A biased start: weight the two cases by who goes first
- A starts with probability and B with .
- If A starts, A wins with ; if B starts, A wins with .
- .
- Weight the two cases by who goes first.
Page 3 of 3Pictures: Venn regions and trees
Venn diagram, two events: every region from the given probabilities
- The picture shows a Venn diagram of two events with , and .
- The overlap is , the part of only is , the part of only is , and lies outside both circles.
- A only: . B only: .
- The four regions add to .
Venn diagram, three events: every region in x
- Let and fill every region in .
- The regions are: only , only , is , only , is , only and only .
- Outside all three circles is .
- Outside gives .
Tree diagram: tries, with the ends of the paths multiplied
- The first try is a hit with ; after a hit the next try is a hit with , and after a miss with .
- The path ends are for hit then hit, for hit then miss, for miss then hit and for miss then miss.
- The two ends with a hit on the second try are highlighted: .
- Multiply along a path.
Tree diagram: balls, 5 red and 3 blue without replacement
- The first branches are red and blue. After a red, the next is red with and blue with ; after a blue, red with and blue with .
- The path ends are for red then red, for red then blue, for blue then red and for blue then blue.
- , from the two highlighted ends.
- B then R is , the numerator of .
Tree diagram: the test, with D and D' and the positive ends
- The disease has proportion , so the first branches are for and for . The test is positive with after and after .
- The path ends are for D and positive, for D and negative, for D' and positive, and for D' and negative.
- The two positive ends are highlighted.
- .
Worked examples
Probability worked examples
Mr Ian’s worked examples for the chapter, with the full working.
Translate the wording into events
“Given B” restricts the sample space to B. “A or B” includes the overlap unless the question says “but not both”. “At least one” often suggests a complement. Write the event before entering numbers: the main difficulty is usually deciding what belongs in the numerator and denominator.
Use the overlap to recover missing probabilities
Two conditional probabilities and “neither”
Events A and B satisfy , , and . Find .
Let . Turn the conditional statements into expressions for the whole sets:
The union is the complement of “neither”:
Check the four disjoint regions: A only is 0.42, both is 0.14, B only is 0.14, and neither is 0.30. They are non-negative and sum to one.
Independence needs a calculation
Mutually exclusive and independent are different tests
Two fair six-sided dice are thrown. Let A be “the sum is odd”, B be “at least one score exceeds 4”, and C be “the scores are equal”. Determine which pair is mutually exclusive and which is independent, then find .
Equal scores give an even sum. Thus A and C cannot occur together: . For independence, use all 36 equally likely ordered outcomes.
Therefore A and B are independent. The ten outcomes in their intersection are and their reverses. For B and C, only satisfy both:
These are unequal, so B and C are not independent. Finally,
Positive-probability mutually exclusive events cannot be independent: their intersection is zero, while the product of their probabilities is positive.
Find bounds by making every region non-negative
An unknown overlap
Given and , find the least and greatest possible values of and .
Let . Fill the four disjoint regions before forming inequalities:
Each region must be at least zero:
Both endpoints are attainable: at , the “neither” region vanishes; at , C is contained in A. Independence is not assumed.
Move the overlap while keeping both totals fixed
x = 0.40: all four regions are non-negative; P(A | C) = 0.667.
Three events: a known subset removes regions
Let , , , and . Since , all of B’s probability lies in A. Draw B inside A. B contributes 0.1 inside C and 0.1 outside C. Put . Fill the entire Venn diagram in terms of t:
The other non-zero regions are A only , C only , B outside C 0.1, B inside C 0.1, and outside A and C . Hence
This fraction increases with t: its numerator increases and its positive denominator decreases. The least value is , and the greatest is . If A and C are independent, , giving .
Multiply along paths, add the required paths
Reverse a conditional probability
A factory uses machine A for 60% of items and machine B for 40%. Defect probabilities are 0.02 and 0.05 respectively. An item is defective. Find the probability that B made it.
The first split is the machine, then defect/no defect. The defective event has two disjoint paths:
The answer is not 0.05: that is , with the conditioning reversed. The more defective machine can account for most defects despite making fewer items.
When the next result depends on the previous result
A player hits on the first throw with probability 0.7. After a hit the next hit probability is 0.8; after a miss the next hit probability is 0.6. Find the probability of a hit on throw 2, then the probability of exactly two hits in three throws given that throw 2 was a miss.
Given a miss on throw 2, two hits in total require the single path HMH. Its last hit follows a miss, so use 0.6:
Do not reuse the first-throw probability on later branches. These successive throws are not independent.
Conditional counting without replacement
Restrict the denominator to the given selections
A bag contains four red and six blue balls. Five are selected without replacement. Given that at least three are red, find the probability that exactly two are blue.
The condition allows three red or four red; five red is impossible. In the numerator, exactly two blue means three red.
Let q be the required conditional probability.
The denominator is 66 eligible selections, not all selections. The common unrestricted denominator cancels in the conditional ratio.
A repeated game can give a geometric series
Alternating turns until the first success
A and B take turns, A first. Each attempt succeeds independently with probability , and the first success wins. Find the probability A wins. Given that B wins, find the probability B wins on B’s second turn.
A wins immediately, or after one complete failed round, or after two, and so on. Each failed round has probability :
There is no positive probability of endless play, since . Hence . B wins on B’s second turn on the path A fails, B fails, A fails, B succeeds:
A turn number is not a total throw number. B’s second turn is throw 4.
Before you finish
Check that the conditioning event has positive probability, tree branches at each split add to one, and all disjoint regions are non-negative. Test independence with an equality; do not infer it from different event names.