PROBABILITY
EXAM STUDY GUIDE
Definitions + notation + formulas + mini examples
Sheldon Ross, A First Course in Probability, 10th Global Edition
Sections 2.1–2.5 and 3.1–3.4
How to use this in the next 2 days. Pass 1 (20–30 min): read the notation glossary. Pass 2: cover the Meaning column and explain
each symbol aloud. Pass 3: cover the Mini example and make your own. Then move immediately to practice problems. This guide
is a map, not a substitute for solving problems.
Section
Core idea
What to be able to do
2.1–2.2
Sample spaces, events, set notation
You need this language for everything else.
2.3–2.4
Probability axioms and consequences
Complement, addition rule, inclusion–exclusion.
2.5
Equally likely outcomes
Probability becomes a counting problem.
3.1–3.2
Conditional probability
“Given that” changes the sample space.
3.3
Conditioning, odds, total probability, Bayes
Break into cases; reverse conditional probabilities.
3.4
Independence
When information about one event does not change
another.
Source note: This guide paraphrases and reorganizes the assigned Ross sections for rapid studying. Examples are newly written unless identified as a Ross-style
example.
Probability Exam Review | 1
1. Master notation glossary
Learn this first. If the symbols feel automatic, the later formulas become much easier.
Notation / term
Meaning
Mini example
π
Sample space: set of all possible outcomes.
One coin toss: π = {π», π }.
outcome
One possible result of the experiment.
For two dice, (2, 5) is one outcome.
πΈ, πΉ, π΄, π΅, . . .
Letters used to name events, which are subsets of π.
πΈ = {sum of two dice is 7}.
πΈ∪πΉ
Union: πΈ or πΉ or both occurs.
Even die or die > 4: {2, 4, 5, 6}.
πΈ πΉ or πΈ ∩ πΉ
Intersection: both πΈ and πΉ occur. Ross often writes πΈ πΉ.
Even and > 4: {6}.
∅
Null/empty event: contains no outcomes.
“Roll a 7 on one standard die.”
mutually exclusive
Events with no common outcomes: πΈ πΉ = ∅.
On one die: πΈ = {1}, πΉ = {6}.
πΈπ
Complement: πΈ does not occur.
If πΈ = {even}, then πΈ π = {1, 3, 5}.
πΈ⊂πΉ
πΈ is contained in πΉ; occurrence of πΈ implies πΉ.
{6} ⊂ {even}.
πΉ⊃πΈ
Ð
π πΈπ
Ñ
π πΈπ
πΉ is a superset of πΈ.
Same containment relationship.
Union of many events: at least one πΈ π occurs.
“At least one of the listed events occurs.”
Intersection of many events: every πΈ π occurs.
“All listed events occur.”
If πΈ = {2, 4, 6}, then |πΈ | = 3.
|πΈ |
Number of outcomes in a finite event πΈ.
π(πΈ)
Probability of event πΈ.
Fair die: π(even) = 1/2.
π(πΈ)
Number of times πΈ occurs in π repetitions.
54 heads in 100 tosses: π(π») = 54.
π(πΈ | πΉ)
Conditional probability of πΈ given πΉ. Treat πΉ as the reduced
sample space.
π(sum = 8 | first die = 3) = 1/6.
π(πΈ πΉ)
Probability that πΈ and πΉ both occur.
First die 3 and sum 8: 1/36.
πΉ1 , . . . , πΉπ exhaustive
Their union is π: one of them must occur.
Rain / no rain.
mutually exclusive + exhaustive
Exactly one of the cases occurs; used in total probability/Bayes.
Die cases πΉπ = {die = π}.
odds of π΄
π( π΄)/π( π΄π ) = π( π΄)/(1 − π( π΄)).
If π( π΄) = 2/3, odds are 2 to 1.
independent πΈ, πΉ
π(πΈ πΉ) = π(πΈ)π(πΉ). Knowing one does not change the
other.
Separate fair coin tosses.
dependent πΈ, πΉ
Not independent.
Two draws without replacement.
trial
Independent subexperiments with the same possible outcomes.
Repeated coin tosses.
π
Common notation for success probability on each independent
trial.
π(success) = π, failure = 1 − π.
π =1− π
π
Failure probability in some examples.
π
Number of unordered π-element selections from π.
If π = .6, π = .4.
5
2 = 10.
π!
Factorial.
5! = 5 · 4 · 3 · 2 · 1 = 120.
Important Ross shorthand. Ross frequently writes πΈ πΉ instead of πΈ ∩ πΉ. Read πΈ πΉ as “E AND F,” not as multiplication. He also
uses πΈ π for “not E” and π(πΈ | πΉ) for “probability of E given F.”
Probability Exam Review | 2
2. Sections 2.1–2.2 - Sample spaces and events
2.1 Introduction
Before assigning probabilities, describe all possible outcomes (the sample space) and the events you care about.
2.2 Core definitions
Term
Definition
Example
Sample space π
All possible outcomes.
Two tosses: {π»π», π»π, π π», ππ }.
Event πΈ
Any subset of π. Event occurs when actual outcome belongs to πΈ.
First toss H: {π»π», π»π }.
Union πΈ ∪ πΉ
Outcomes in πΈ, πΉ, or both.
“At least one head.”
Intersection πΈ πΉ
Outcomes in both πΈ and πΉ.
First H and second T: {π»π }.
Null event ∅
Event with no outcomes.
Sum 1 with two dice.
Mutually exclusive
πΈ πΉ = ∅; cannot occur together.
Roll 1 and roll 6 on one die.
Complement πΈ π
All outcomes in π not in πΈ.
Not sum 7.
Containment πΈ ⊂ πΉ
Every outcome in πΈ also belongs to πΉ.
Roll 6 ⊂ roll even.
Set-operation laws Ross expects you to recognize
πΈ ∪ πΉ = πΉ ∪ πΈ,
πΈ πΉ = πΉπΈ
(πΈ ∪ πΉ) ∪ πΊ = πΈ ∪ (πΉ ∪ πΊ),
(πΈ πΉ)πΊ = πΈ (πΉπΊ)
(πΈ ∪ πΉ)πΊ = πΈπΊ ∪ πΉπΊ
(πΈ ∪ πΉ) π = πΈ π πΉ π ,
(πΈ πΉ) π = πΈ π ∪ πΉ π
How to read DeMorgan quickly. When a complement moves across parentheses, UNION and INTERSECTION switch. “not (A or
B)” means “not A and not B.”
3. Section 2.3 - Axioms of probability
Relative-frequency notation
π(πΈ) is the number of times event πΈ occurs in the first π repetitions. The long-run idea is
π(πΈ)
.
π→∞ π
π(πΈ) = lim
Ross then treats π as a set function satisfying three axioms:
1. 0 ≤ π(πΈ) ≤ 1
2. π(π) = 1
3. For mutually exclusive πΈ 1 , πΈ 2 , . . ., π(
Ð
π πΈπ ) =
Í
π π(πΈ π )
Immediate consequence: π(∅) = 0. For a finite collection of mutually exclusive events, probabilities add.
Probability Exam Review | 3
4. Section 2.4 - Simple propositions you will actually use
Rule
Formula
Use / interpretation
Complement
π(πΈ π ) = 1 − π(πΈ)
Best shortcut for “at least one”: 1 − π(none).
Monotonicity
If πΈ ⊂ πΉ, π(πΈ) ≤ π(πΉ).
Conceptual sanity check.
Two-event addition
π(πΈ ∪ πΉ) = π(πΈ) + π(πΉ) − π(πΈ πΉ)
Subtract the overlap because it was counted twice.
Three-event
exclusion
singles - pairwise intersections + triple
intersection
Ð
Í
π( π πΈ π ) ≤ π π(πΈ π )
Use for three overlapping events; signs alternate +, −, +.
inclusion–
Boole inequality
Upper bound on probability that at least one bad event
occurs.
Fast exam pattern: “at least one.” Before adding many cases, ask whether the complement is easier. Four independent fair coin
tosses: π(at least one H) = 1 − (1/2) 4 = 15/16.
5. Section 2.5 - Equally likely outcomes
When π is finite and every elementary outcome has the same probability, probability becomes counting:
π(πΈ) =
|πΈ | favorable outcomes
=
|π|
total outcomes
Counting notation used repeatedly
Notation / idea
Meaning
Example
π!
π
Ordered arrangements of π distinct objects.
π
Unordered groups of π selected from π.
5! = 120.
10
3 = 120.
Ordered selection
Unordered selection
Order matters; multiply choices stage by stage.
Order does not matter; use combinations.
3 draws without replacement from 11: 11 · 10 · 9.
3-ball subset from 11: 11
3 .
Key modeling decision. Numerator and denominator must use the same representation. Ordered over ordered, or unordered over
unordered.
Ross-style example. From 6 white and 5 black balls, choose 3 and want exactly 1 white + 2 black. π =
Probability Exam Review | 4
6 5
1 2
= 4/11.
11
3
6. Sections 3.1–3.2 - Conditional probability
Conditional probability handles two situations: you are given partial information, or conditioning makes a hard probability easier.
π(πΈ | πΉ) =
π(πΈ πΉ)
,
π(πΉ)
π(πΉ) > 0
Meaning: Once πΉ is known to have occurred, πΉ becomes the reduced sample space.
Mini example. Let πΈ = {sum = 8}, πΉ = {first die = 3}. Giv
π(πΈ | πΉ) = 1/6.
Multiplication rule
π(πΈ πΉ) = π(πΈ | πΉ)π(πΉ) = π(πΉ | πΈ)π(πΈ)
For many events:
π(πΈ 1 · · · πΈ π ) = π(πΈ 1 )π(πΈ 2 | πΈ 1 ) · · · π(πΈ π | πΈ 1 · · · πΈ π−1 )
Recognition cue. Words such as “then,” “followed by,” “all of these happen,” sequential draws, or a chain of conditions often signal
the multiplication rule.
7. Section 3.3 - Conditioning, odds, total probability, Bayes
Condition on an event and its complement
π(πΈ) = π(πΈ | πΉ)π(πΉ) + π(πΈ | πΉ π )π(πΉ π )
Odds
π( π΄)
π( π΄)
=
π( π΄π ) 1 − π( π΄)
odds of π΄ =
Updating odds with evidence:
π(π») π(πΈ | π»)
π(π» | πΈ)
=
·
π
π(π» | πΈ)
π(π» π ) π(πΈ | π» π )
Law of total probability
If πΉ1 , . . . , πΉπ are mutually exclusive and exhaustive:
π(πΈ) =
∑οΈ
π(πΈ | πΉπ )π(πΉπ )
π
Bayes formula
π(πΈ | πΉ π )π(πΉ π )
π(πΉ π | πΈ) = Í
π π(πΈ | πΉπ )π(πΉπ )
Bayes setup checklist. 1) Name possible causes πΉπ . 2) Verify they cover all possibilities and do not overlap. 3) Write evidence πΈ. 4)
Compute each branch π(πΈ | πΉπ )π(πΉπ ). 5) Divide the desired branch by the sum of all branches.
Probability Exam Review | 5
8. Section 3.4 - Independent events
Two-event definition
πΈ, πΉ independent ⇐⇒ π(πΈ πΉ) = π(πΈ)π(πΉ)
When defined, this is equivalent to π(πΈ | πΉ) = π(πΈ) and π(πΉ | πΈ) = π(πΉ). Mini example. Card rank vs. suit: π(ace and spade) = 1/52, while
Dependent means simply “not independent.” Without replacement usually creates dependence because the first selection changes
what remains.
Complements
If πΈ and πΉ are independent, then the corresponding combinations involving complements are also independent.
Three events: pairwise checks are not enough
For πΈ, πΉ, πΊ to be independent, all four conditions must hold:
π(πΈ πΉ) = π(πΈ)π(πΉ),
π(πΈπΊ) = π(πΈ)π(πΊ),
π(πΉπΊ) = π(πΉ)π(πΊ),
π(πΈ πΉπΊ) = π(πΈ)π(πΉ)π(πΊ).
Repeated independent success/failure trials
π(no successes) = (1 − π) π ,
π(at least one) = 1 − (1 − π) π
π π
π(exactly π) =
π (1 − π) π−π
π
Parallel system. If independent components have reliabilities π π , then π(system works) = 1 −
Probability Exam Review | 6
Î
π (1 − π π ).
9. Common confusions and exam traps
Mutually exclusive ≠ independent.
Mutually exclusive means πΈ πΉ = ∅. Independent means π(πΈ πΉ) = π(πΈ)π(πΉ). Positive-probability mutually exclusive events cannot
be independent.
π(πΈ | πΉ) ≠ π(πΉ | πΈ).
Conditional probability has a direction.
“Given πΉ” means shrink the sample space.
For equally likely outcomes, remove outcomes outside πΉ first.
Without replacement usually creates dependence.
Later probabilities change because the composition changes.
With replacement often restores the same probabilities.
When the same randomization repeats, successive draws may be independent.
“At least one” often wants a complement.
π(at least one) = 1 − π(none).
Counting requires a consistent sample space.
Never count ordered favorable outcomes over unordered total outcomes, or vice versa.
Pairwise independent is weaker than mutual independence.
For three events, also check the three-way product equation.
Bayes needs base probabilities.
A large π(πΈ | πΉ π ) alone does not determine π(πΉ π | πΈ).
10. Word cues → likely method
Words in problem
Think
“given that”, “knowing that”
Conditional probability: π(πΈ | πΉ).
“and”, “all occur”, sequential stages
Intersection / multiplication rule.
“or”, “at least one of these events”
Union / addition rule; consider inclusion–exclusion.
“at least one”
Try 1 − π(none) first.
“randomly selected” + finite equally likely outcomes
Count favorable / count total.
“which source/cause did it come from?” after
evidence
Bayes formula.
Several possible cases covering all possibilities
Law of total probability.
“does knowing F change E?”
Repeated identical independent success/failure
trials
Test independence.
Use π, 1 − π; exactly π gives ππ π π (1 − π) π−π .
Probability Exam Review | 7
11. One-page formula sheet
Concept
Formula
Complement
π(πΈ π ) = 1 − π(πΈ)
Addition
π(πΈ ∪ πΉ) = π(πΈ) + π(πΉ) − π(πΈ πΉ)
Equally likely finite space
π(πΈ) = |πΈ |/|π|
Conditional
π(πΈ | πΉ) = π(πΈ πΉ)/π(πΉ)
Two-event multiplication
π(πΈ πΉ) = π(πΈ | πΉ)π(πΉ)
General multiplication
π(πΈ 1 · · · πΈ π ) = π(πΈ 1 )π(πΈ 2 | πΈ 1 ) · · · π(πΈ π | πΈ 1 · · · πΈ π−1 )
Condition on πΉ/πΉ π
Odds
π(πΈ) = π(πΈ | πΉ)π(πΉ) + π(πΈ | πΉ π )π(πΉ π )
Í
π(πΈ) = π π(πΈ | πΉπ )π(πΉπ )
π(πΈ | πΉ π )π(πΉ π )
π(πΉ π | πΈ) = Í
π π(πΈ | πΉπ )π(πΉπ )
π( π΄)/π( π΄π )
Independence
π(πΈ πΉ) = π(πΈ)π(πΉ)
At least 1 success
1 − (1 − π) π
π π
π−π
π π (1 − π)
Total probability
Bayes
Exactly π successes
Your readiness test. Without looking back, explain every symbol in π(πΈ | πΉ) = π(πΈ πΉ)/π(πΉ), explain the difference between
mutually exclusive and independent, and set up one Bayes problem from words. If you can do those cleanly, start mixed practice
immediately.
END OF GUIDE
• Next step: practice, not rereading.
Probability Exam Review | 8