Probability and Counting

Algebra 2Module 12: ProbabilityProblem-Solving and Data Analysis

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.

Outcome — one single result of an experiment (rolling a 4).
Sample space S — the set of all possible outcomes. For one die, S = {1, 2, 3, 4, 5, 6}.
Event — any subset of the sample space, such as A = {rolling an odd number} = {1, 3, 5}.
n(A) — the number of outcomes in event A. So n(A) = 3 above.
P(A) = n(A) / n(S) = (number of outcomes in A) / (total number of possible outcomes)

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.

+123456
1234567
2345678
3456789
45678910
567891011
6789101112

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.

Key Concept · Probability Rule for Intersections
The probability of the intersection of two events A and B occurring is the ratio of the number of outcomes in both A and B to the total number of possible outcomes.
P(A ∩ B) = (number of outcomes in A and B) / (total number of possible outcomes)
Intersection, union and the outside region
S (all outcomes) A B A ∩ B A ∪ B is everything inside either circle
Click a chip to isolate one part of the picture. The green lens belongs to both circles — that is why it is counted only once in a union.
Study Tip — Intersection: the symbol for intersection is ∩, 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.

Key Concept · Union of Two Events
The number of elements in the union of two events A and B is the number of outcomes in both event A and B minus the number of outcomes in their intersection.
n(A ∪ B) = n(A) + n(B) − n(A ∩ B)

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.

Study Tip — Union: the symbol for union is ∪, 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.

Spinner with eight equal sections
1 GREEN 3 GREEN 5 GREEN 7 BLUE 9 RED 11 RED 13 PURPLE 15 BLUE
Eight equal sections, so every section has probability 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.

Key Concept · Probability of the Complement of an Event
WordsThe probability that an event will not occur is equal to 1 minus the probability that the event will occur.
SymbolsFor an event A, P(A′) = 1 − P(A), and therefore P(A) + P(A′) = 1.
The complement of A
A S A′ shaded orange region = every outcome not in A
The blue circle and the orange region together fill the whole sample space: n(A) + n(A′) = n(S).
Watch Out! The complement is 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).

Tossing a coin twice
Toss 1 Toss 2 Outcome H T H T H T HH HT TH TT
Four equally likely outcomes, so each has probability 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.

n(S) = n1 × n2 × n3 × …  (one factor per stage)
Toss a coin, then roll a die
Coin Die Outcome H T H1H2H3 H4H5H6 T1T2T3 T4T5T6
2 coin results × 6 die results = 12 outcomes, and the tree has exactly 12 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 deckNumber card (2–10)Face card (J, Q, K)AceTotal
Red (♥ ♦)186226
Black (♠ ♣)186226
Total3612452

P(red ∩ face) = 6/52 = 3/26.   n(red ∪ face) = 26 + 12 − 6 = 32, so P(red ∪ face) = 32/52 = 8/13.

1
∩ means and (overlap, fewer outcomes). ∪ means or (combine, more outcomes).
2
P(A ∩ B) = n(A ∩ B) / n(S) — count the outcomes that satisfy both conditions, then divide by the total.
3
n(A ∪ B) = n(A) + n(B) − n(A ∩ B) — add, then remove the double count.
4
P(A′) = 1 − P(A) — when “not”, “at least one” or “fails to” appears, the complement is usually the shortcut.
5
A multi-stage experiment has n1 × n2 × … outcomes — the number of leaves on its tree diagram.
Watch Out! In a union, an outcome in both events is listed once. For a die with 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

A fair die is rolled once. Let A be the event of rolling an odd number, and let B be the event of rolling a number greater than 3. Find A ∩ B.
1S = {1, 2, 3, 4, 5, 6}sample space of one die
2A = {1, 3, 5}the odd numbers on a die
3B = {4, 5, 6}the numbers greater than 3
4A ∩ B contains the outcomes in both A and Bdefinition of intersection
5only 5 appears in both listscompare element by element
A ∩ B = {5}, so n(A ∩ B) = 1 and P(A ∩ B) = 1/6
Check: 5 is odd ✓ and 5 > 3 ✓. The number 3 is odd but not greater than 3, and 4 and 6 are greater than 3 but not odd, so neither belongs.
A card is selected from a standard deck of cards. What is the probability that the card is a queen and is red?

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.

1n(A) = 4  (Q♠, Q♥, Q♦, Q♣)one queen per suit
2n(B) = 26  (all hearts and diamonds)half the deck is red
3A ∩ B = {Q♥, Q♦}, so n(A ∩ B) = 2queens that are also red
4P(A ∩ B) = n(A ∩ B) / 52Probability Rule for Intersections
5= 2/52Substitution
6= 1/26Simplify
P(queen ∩ red) = 1/26 ≈ 0.038, or about 3.8%
Watch Out! The denominator is 52, the size of the whole sample space. A common error is dividing by 26 (only the red cards) or by 4 (only the queens).
A fair die is rolled once. Let A be the event of rolling a number less than 5, and let B be the event of rolling a multiple of 2. Find A ∪ B.
1A = {1, 2, 3, 4}numbers on a die less than 5
2B = {2, 4, 6}multiples of 2 on a die
3A ∪ B contains outcomes in either sample spacedefinition of union
4A ∪ B = {1, 2, 3, 4, 6}list each outcome once
5n(A ∪ B) = 4 + 3 − 2 = 5n(A) + n(B) − n(A ∩ B)
A ∪ B = {1, 2, 3, 4, 6}, n(A ∪ B) = 5, P(A ∪ B) = 5/6
Why are 2 and 4 only listed once? They belong to both events, but a union is a set of outcomes — rolling a 2 is a single outcome no matter how many events describe it. That is exactly the − n(A ∩ B) in the formula, since A ∩ B = {2, 4}.
A streaming program randomly picks one movie from a list of favourites, sorted by genre as shown. What is the probability that a comedy will not be chosen?
GenreNumber of moviesGenreNumber of movies
Action44Documentaries13
Anime109Dramas30
Children’s8Foreign5
Comedies112Horror29

Let event A represent selecting a comedy. Then find the probability of the complement of A.

1n(A) = 112comedy movies in the list
2n(S) = 44+109+8+112+13+30+5+29 = 350total movies in the list
3P(A′) = 1 − P(A)Probability of a complement
4= 1 − 112/350Substitution
5= 238/350 = 17/25Subtract and simplify
P(A′) = 17/25 = 0.68, or 68%
Check: counting directly, 350 − 112 = 238 non-comedies, and 238/350 = 17/25 ✓. Also 112/350 + 238/350 = 1 ✓.
Use the eight-section spinner above. Let A be the event of landing on a blue section, and let B be the event of landing on a section whose number is divisible by 3. Find A, B, A ∩ B and A ∪ B.
1S = {1, 3, 5, 7, 9, 11, 13, 15}, n(S) = 8eight equal sections
2A = {7, 15}the two blue sections
3B = {3, 9, 15}3 = 3·1, 9 = 3·3, 15 = 3·5
4A ∩ B = {15}15 is blue and divisible by 3
5n(A ∪ B) = 2 + 3 − 1 = 4Union of Two Events
6A ∪ B = {3, 7, 9, 15}list to confirm the count

Intersection

A ∩ B = {15}
P(A ∩ B) = 1/8 = 0.125

Union

A ∪ B = {3, 7, 9, 15}
P(A ∪ B) = 4/8 = 1/2
A ∩ B = {15}   and   A ∪ B = {3, 7, 9, 15}
Watch Out! Adding 2 + 3 = 5 would count section 15 twice. Always subtract the intersection.

Try It Yourself

Problem 1

A fair die is rolled once. Let A be the event of rolling a multiple of 3, and let B be the event of rolling a number greater than 2. Find A ∩ B and A ∪ B.
1A = {3, 6},   B = {3, 4, 5, 6}list each event
2A ∩ B = {3, 6}both 3 and 6 are > 2
3n(A ∪ B) = 2 + 4 − 2 = 4Union of Two Events
A ∩ B = {3, 6};   A ∪ B = {3, 4, 5, 6};   P(A ∪ B) = 4/6 = 2/3

Problem 2

A card is selected from a standard deck. Find P(the card is a face card and is black).
1face cards per suit: J, Q, K → 3definition of a face card
2black suits: ♠ and ♣ → 2 suits3 × 2 = 6 outcomes in the overlap
3P = 6/52Probability Rule for Intersections
P(face ∩ black) = 6/52 = 3/26 ≈ 0.115

Problem 3

For two events, n(A) = 15, n(B) = 11 and n(A ∪ B) = 20. Find n(A ∩ B).
1n(A ∪ B) = n(A) + n(B) − n(A ∩ B)Union of Two Events
220 = 15 + 11 − n(A ∩ B)Substitution
320 = 26 − n(A ∩ B)Simplify
4n(A ∩ B) = 6Solve
n(A ∩ B) = 6

Problem 4

A spinner has 8 equal sections numbered 1 through 8. Find the probability of not landing on a multiple of 3.
1A = {3, 6}, so n(A) = 2multiples of 3 from 1 to 8
2P(A) = 2/8 = 1/4equally likely sections
3P(A′) = 1 − 1/4Probability of a complement
P(A′) = 3/4 = 0.75

Problem 5

A coin is tossed three times. How many outcomes are in the sample space, and what is P(exactly two heads)?
1n(S) = 2 × 2 × 2 = 8three stages, 2 choices each
2S = {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT}read the leaves of the tree
3exactly two heads: HHT, HTH, THH → 3 outcomescount the favourable leaves
n(S) = 8 and P(exactly two heads) = 3/8 = 0.375

Problem 6

Two fair dice are rolled. Use the sum grid to find P(sum ≤ 4).
1n(S) = 6 × 6 = 36two stages of six
2sum 2: (1,1) → 1 cellread the grid
3sum 3: (1,2), (2,1) → 2 cellsread the grid
4sum 4: (1,3), (2,2), (3,1) → 3 cellsread the grid
5P = (1 + 2 + 3)/36 = 6/36add the favourable cells
P(sum ≤ 4) = 6/36 = 1/6 ≈ 0.167

Summary

SituationWhat to doResult
Both A and B must happenCount 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) happensAdd the two counts, then subtract the shared outcomesn(A ∪ B) = n(A) + n(B) − n(A ∩ B)
A does not happenFind P(A) and subtract from 1P(A′) = 1 − P(A)
The events share no outcomesNothing to removeA ∩ B = ∅ and n(A ∪ B) = n(A) + n(B)
The experiment happens in stagesDraw a tree diagram or multiply the number of choices at each stagen(S) = n1 × n2 × …
Two features sort the same objectsBuild a two-way table; an intersection is one cellrow total + column total − cell
P(A) = n(A)/n(S) P(A ∩ B) = n(A ∩ B)/n(S) n(A ∪ B) = n(A) + n(B) − n(A ∩ B) P(A′) = 1 − P(A) P(A) + P(A′) = 1 n(S) = n1 × n2
Common mistakes to avoid
  • 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 of 1 − P(A).
  • Listing a shared outcome twice inside a union set.
  • Forgetting that an empty intersection is ∅, a set with n = 0, not the number 0 itself.

Practice Quiz

15 questions · click an answer to check it instantly

0/15

๐Ÿ“ Test your understanding