S1.3 - Probability
- Syllabus
- 2019
- Topic
- S1.3
- Level
- AS
Probability measures how likely an event is on a scale from 0 to 1. An impossible event has probability 0, a certain event probability 1, and all probabilities for a complete set of mutually exclusive outcomes add to 1.
| Information available | Probability model |
|---|---|
| equally likely outcomes | P(A)=total number of outcomesnumber of outcomes in A |
| frequency table or survey | P(A)=total frequencyfrequency in A for a randomly selected recorded item |
| repeated observations | relative frequency =number of trialsnumber of occurrences of A, used as an estimate of P(A) |
Define the event before counting. Check that every outcome belongs to the same sample space, that totals use the correct population or trial count, and that outcomes are genuinely equally likely before using a simple favourable-over-total ratio.
A table records 320 households, 200 with a driveway and 88 with exactly two cars. For a household chosen at random from this table,P(driveway)=320200=85.Among the households with a driveway, suppose 40 have exactly one car. Then the joint event 'driveway and exactly one car' has probability 40/320=1/8.
A count ratio describes the stated data or an equally likely model; it is not automatically valid for a different population. Do not divide by the wrong total, count overlapping categories twice, or round intermediate probabilities so early that a final result drifts.
A sample space Ω contains every possible outcome. An event is a subset of that space; unions mean 'at least one', intersections mean 'both', and complements mean 'not'.
| Relationship | Meaning | Probability rule |
|---|---|---|
| complement A′ | outcomes not in A | P(A′)=1−P(A) |
| union A∪B | A or B or both | P(A∪B)=P(A)+P(B)−P(A∩B) |
| mutually exclusive | A and B cannot occur together | P(A∩B)=0 |
| conditional A∣B | restrict the sample space to outcomes in B | P(A∣B)=P(B)P(A∩B), for P(B)>0 |
P(A∩B)=P(A)P(B∣A)
List outcomes or partition a Venn diagram into disjoint regions before adding. Every region of a Venn diagram must represent one exact combination of event membership, and all regions—including the outside region—must total 1.
Suppose P(A)=0.55, P(B)=0.40 and P(A∩B)=0.20. ThenP(A∪B)=0.55+0.40−0.20=0.75,P((A∪B)′)=0.25,and, after restricting to B,P(A∣B)=0.400.20=0.50.The denominator changes because the condition changes the relevant sample space.
Do not interpret 'or' as excluding the intersection unless the events are stated to be mutually exclusive. Conditional probability is not a new joint region: it rescales the relevant intersection by the probability of the condition. Mutually exclusive non-zero events are not independent.
Events A and B are independent when knowing that one occurred does not change the probability of the other.
P(B∣A)=P(B),P(A∣B)=P(A),P(A∩B)=P(A)P(B)
To test independence, calculate both sides of one complete equality using the same data. Equality supports independence; a difference proves dependence. The conditional forms require the conditioning event to have positive probability.
For a fair six-sided die, let A be 'even' and B be 'a multiple of 3'. Then P(A)=1/2, P(B)=1/3 and P(A∩B)=P(6)=1/6. Since (1/2)(1/3)=1/6, A and B are independent. If C is 'greater than 3', then P(A∩C)=2/6=1/3 but P(A)P(C)=1/4, so A and C are not independent.
| Idea | Intersection of two non-zero events |
|---|---|
| independent | generally non-empty; probability is the product of marginal probabilities |
| mutually exclusive | empty; occurrence of one makes the other impossible |
Do not declare independence because two probabilities look similar, multiply branches without first justifying independence or using the correct conditional probability, or confuse independent events with mutually exclusive events.
Multi-stage probability uses the product law along one route and the sum law across distinct routes. A tree diagram records changing conditional probabilities; a Venn diagram partitions simultaneous event combinations.
| Move | Operation |
|---|---|
| follow one complete tree route | multiply its branch probabilities |
| combine mutually exclusive routes giving the required event | add their route probabilities |
| find 'at least one' | often use 1−P(none) |
| sample with replacement | restore the item, so later composition and denominators are unchanged |
| sample without replacement | update both the favourable count and total after each selection |
At every node, outgoing branch probabilities total 1. Label branches with conditional probabilities for the situation at that node, not with unconditional probabilities copied from the start. In a Venn diagram, add only the disjoint regions that satisfy the event expression.
A bag contains 3 red and 2 blue counters. Two are selected without replacement. The probability of exactly one red is5342+5243=53.The probability of at least one red is1−5241=109.With replacement, exactly one red instead has probability2(53)(52)=2512,because the second draw again starts from five counters.
When repeated routes have the same probability, count how many distinct orders produce the event before multiplying. When branch probabilities change without replacement, apparently similar orders may still need to be written separately so their numerators and denominators are correct.
Do not add probabilities along a route, multiply alternative routes, keep a denominator unchanged after sampling without replacement, or use a factor such as 2 or 3 without checking that it counts all and only the required distinct orders.