Probability and Counting
Learn probability and counting step by step with worked examples you can follow. Then practise with 37 instant-feedback questions. Free Algebra 2 lesson from Mr Ahmed Hamouda.
Describe events as subsets of a sample space using intersections, unions and complements, and count outcomes to find their probabilities.
Core Concepts
1. Outcomes, sample spaces and events
Probability starts with counting. Before you can find a probability you must know two numbers: how many results the experiment can produce in total, and how many of those results you actually want.
S — the set of all possible outcomes. For one die, S = {1, 2, 3, 4, 5, 6}.A = {rolling an odd number} = {1, 3, 5}.n(A) — the number of outcomes in event A. So n(A) = 3 above.When outcomes are equally likely (a fair die, a fair coin, a spinner with equal sections, a well-shuffled deck), probability is nothing more than a count divided by a count.
A sample-space grid. Rolling two dice gives 6 × 6 = 36 equally likely outcomes. The grid below shows the sum for each one, so you can count events by reading the table.
| + | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
Counting 7s in the grid gives 6 cells, so P(sum = 7) = 6/36 = 1/6.
2. Intersection — the outcomes in both events
The intersection of A and B is the set of all outcomes in the sample space of event A that are also in the sample space of event B. In a Venn diagram it is the overlap.
∩, and it is associated with the word and. P(A ∩ B) is read as the probability of A and B. The symbol looks like an A without its bar — A for and.3. Union — the outcomes in either event
The union of A and B is the set of all outcomes in the sample space of event A combined with all outcomes in the sample space of event B. An outcome only has to belong to one of them to join the union — but if it belongs to both, you still list it once.
Why subtract? When you add n(A) + n(B), every outcome sitting in the green lens has been counted twice — once as a member of A and once as a member of B. Subtracting n(A ∩ B) removes exactly one of those two copies.
If the two events share nothing, then n(A ∩ B) = 0, A ∩ B = ∅, and the rule collapses to plain addition.
∪, and it is associated with the word or. n(A ∪ B) is read as the number of elements in A or B. The cup ∪ is open at the top — it holds everything.1/8. Blue sections: {7, 15}. Numbers divisible by 3: {3, 9, 15}. Section 15 belongs to both.4. Complement — everything the event is not
The complement of A consists of all the outcomes in the sample space that are not included as outcomes of event A. It is written A′.
Rolling a die and getting a 3 has probability 1/6. There are 5 outcomes for not getting a 3 — 1, 2, 4, 5, 6 — so P(not 3) = 5/6. Notice that this is also 1 − 1/6. Every outcome is either in A or in A′, never both and never neither, so the two probabilities must add to 1.
| Words | The probability that an event will not occur is equal to 1 minus the probability that the event will occur. |
|---|---|
| Symbols | For an event A, P(A′) = 1 − P(A), and therefore P(A) + P(A′) = 1. |
n(A) + n(A′) = n(S).1 − P(A), not 1 ÷ P(A). If P(A) = 2/5 then P(A′) = 3/5, never 5/2.5. Counting outcomes with a tree diagram
When an experiment happens in stages, a tree diagram lists the whole sample space without missing anything. Read one path from left to right and you get one outcome; count the leaves and you get n(S).
1/4. Reading the leaves, P(exactly one head) = 2/4 = 1/2.You do not always have to draw every branch. If stage 1 has n1 choices and stage 2 has n2 choices, the tree ends with n1 × n2 leaves.
6. Two-way tables organise a deck (or any survey)
A two-way table sorts the same 52 cards by two features at once. Every intersection question is then just one cell, and every union question is a row plus a column minus the shared cell.
| Standard deck | Number card (2–10) | Face card (J, Q, K) | Ace | Total |
|---|---|---|---|---|
| Red (♥ ♦) | 18 | 6 | 2 | 26 |
| Black (♠ ♣) | 18 | 6 | 2 | 26 |
| Total | 36 | 12 | 4 | 52 |
P(red ∩ face) = 6/52 = 3/26. n(red ∪ face) = 26 + 12 − 6 = 32, so P(red ∪ face) = 32/52 = 8/13.
∩ means and (overlap, fewer outcomes). ∪ means or (combine, more outcomes).P(A ∩ B) = n(A ∩ B) / n(S) — count the outcomes that satisfy both conditions, then divide by the total.n(A ∪ B) = n(A) + n(B) − n(A ∩ B) — add, then remove the double count.P(A′) = 1 − P(A) — when “not”, “at least one” or “fails to” appears, the complement is usually the shortcut.n1 × n2 × … outcomes — the number of leaves on its tree diagram.A = {1, 2, 3, 4} and B = {2, 4, 6}, the union is {1, 2, 3, 4, 6} — 2 and 4 appear a single time each, so n(A ∪ B) = 5, not 7.Move It Yourself
Worked Examples
Let A be the event of choosing a queen, and let B be the event of choosing a red card. The total number of outcomes is the total number of cards in a deck, or 52.
− n(A ∩ B) in the formula, since A ∩ B = {2, 4}.| Genre | Number of movies | Genre | Number of movies |
|---|---|---|---|
| Action | 44 | Documentaries | 13 |
| Anime | 109 | Dramas | 30 |
| Children’s | 8 | Foreign | 5 |
| Comedies | 112 | Horror | 29 |
Let event A represent selecting a comedy. Then find the probability of the complement of A.
112/350 + 238/350 = 1 ✓.Intersection
P(A ∩ B) = 1/8 = 0.125
Union
P(A ∪ B) = 4/8 = 1/2
Try It Yourself
Problem 1
Problem 2
Problem 3
Problem 4
Problem 5
Problem 6
Summary
| Situation | What to do | Result |
|---|---|---|
| Both A and B must happen | Count only the outcomes that satisfy both conditions, then divide by n(S) | P(A ∩ B) = n(A ∩ B)/n(S) |
| A or B (or both) happens | Add the two counts, then subtract the shared outcomes | n(A ∪ B) = n(A) + n(B) − n(A ∩ B) |
| A does not happen | Find P(A) and subtract from 1 | P(A′) = 1 − P(A) |
| The events share no outcomes | Nothing to remove | A ∩ B = ∅ and n(A ∪ B) = n(A) + n(B) |
| The experiment happens in stages | Draw a tree diagram or multiply the number of choices at each stage | n(S) = n1 × n2 × … |
| Two features sort the same objects | Build a two-way table; an intersection is one cell | row total + column total − cell |
- Adding
n(A) + n(B)for a union without subtracting the overlap. - Swapping the symbols:
∩is and (smaller set),∪is or (larger set). - Using the wrong denominator — with cards it is always 52, not 13 or 26.
- Writing the complement as
1 ÷ P(A)instead of1 − P(A). - Listing a shared outcome twice inside a union set.
- Forgetting that an empty intersection is
∅, a set withn = 0, not the number 0 itself.
Practice Quiz
15 questions · click an answer to check it instantly