Loading...
Probability measures how likely an outcome is, on a scale from 0 (impossible) to 1 (certain). Everything in this chapter follows from counting outcomes carefully — and from one law that stops you counting the same outcome twice.
The big picture
The single most useful habit here is drawing a Venn diagram and filling in the . Almost every mistake in probability comes from double-counting or from misreading which region a description refers to, and a filled diagram makes both visible. It also pays off well beyond this lesson: conditional probability is reading a Venn diagram with the sample space restricted, and independence is a statement about how two regions overlap. Getting fluent with the diagram now means the harder ideas that follow are mostly translation rather than new mathematics.
What you'll be able to do
The is the set of all possible outcomes. When outcomes are equally likely, the probability of an event is the number of outcomes in it divided by the total.
Listing the sample space systematically is what prevents omissions. For two dice, a grid of the 36 ordered pairs makes every event easy to count, and it makes clear that and are different outcomes.
The equally-likely assumption has to be earned. It holds for a fair die but not for the of two dice, where 7 arises six ways and 12 only one.
Tip — Count ordered outcomes. Treating and as one outcome halves several probabilities and is a standard error.
For any two events, . The subtraction is the whole content of the law: outcomes in both events get counted once in and again in , so one copy must be removed.
Events are when they cannot both happen, so and the law simplifies to . On a Venn diagram their circles do not overlap.
The is everything not in , and . It is the shortcut for any "at least one" question, since the opposite of "at least one" is "none".
Without the subtraction the answer would be , which counts the 20% who play both twice. Whenever an "or" probability comes out suspiciously high, check whether the overlap was removed.
A Venn diagram shows events as overlapping regions inside a rectangle representing the sample space. The reliable method is to fill in the , then work outwards subtracting what is already placed.
Filling outwards prevents the most common error: writing the total for inside the part of that excludes . The region " only" holds , not .
Once complete, every probability is read off by counting regions, and the language maps directly: " and " is the overlap, " or " is everything in either circle, "neither" is outside both.
Tip — Check that all your regions sum to the total. If they do not, a value has been placed in the wrong region or an overlap has been double-counted.
Three-set Venn diagrams have eight regions and the same rule applies with more care: fill the triple intersection first, then the pairwise overlaps (subtracting the centre), then the singles, then outside.
Some phrases are worth translating explicitly. "Exactly one" means the three single regions added. "At least two" means the three pairwise regions plus the centre. "At most one" is the complement of "at least two".
Reading the phrase into regions before calculating is faster and safer than trying to build a formula for each case.
Notice that means "in both and ", which those also in . "Exactly and " is a different, smaller region — questions distinguish the two deliberately.
Think like an examiner
Common misconceptions
Probability laws
Stretch yourself
In a group of 120 people, 64 read newspaper , 50 read , 42 read , 22 read both and , 18 read both and , 15 read both and , and 8 read all three. How many read none of the three?
Hint — Fill the Venn diagram from the centre outwards, remembering each pairwise figure includes the centre.
Questions students ask
Key takeaways
How this fits the course
Test yourself
Ready to lock in Probability Basics? Pick a mode and earn XP & Dobloons.
Real past-paper questions on Probability Basics, marked mark-by-mark. How you do feeds straight into your weak-topic list, so your revision keeps targeting what actually needs work.