Goal: name which tool applies and read off the numbers.
Recall Solution 1.1
(a) A fair die means all six faces are equally likely, so we count — this is classical.
(b) Favourable outcomes = multiples of 3 in S = {3,6}, so m=2. Total n=6.
P(A)=nm=62=31.
Recall Solution 1.2
A pin has no symmetry — "point-up" and "point-down" are not equally likely, so there is no n of equal outcomes to count. We must measure: this is empirical.
P(point-up)≈Nf=200118=0.59.
Recall Solution 1.3
Axiom 1, Non-negativity: P(A)≥0 for every event. A probability can never be negative, so −0.2 is illegal. (This is the "No" in No–Sure–Split.)
Goal: plug into the addition and complement rules correctly.
Recall Solution 2.1
All 52 cards are equally likely → classical. The overlap F∩D = face cards that are spades = {J♠, Q♠, K♠}, so ∣F∩D∣=3.
P(F)=5212,P(D)=5213,P(F∩D)=523.
Addition rule (subtract the double-counted overlap):
P(F∪D)=5212+5213−523=5222=2611.
Recall Solution 2.2
"At least one head" has many cases; its complement "no heads" (all tails, TTTT) has exactly one. Use the complement rule.
Each of the 24=16 sequences is equally likely, and TTTT is one of them:
P(no head)=161.P(at least one head)=1−161=1615.
Recall Solution 2.3
Ordered pairs keep outcomes equally likely → n=36. Sums ≤4: sum 2: (1,1); sum 3: (1,2),(2,1); sum 4: (1,3),(2,2),(3,1). That is m=1+2+3=6.
P(sum≤4)=366=61.
Goal: choose the right decomposition, handle overlaps and unequal-likelihood.
Recall Solution 3.1
Rearrange the addition rule to solve for the overlap:
P(A∩B)=P(A)+P(B)−P(A∪B)=0.5+0.4−0.7=0.2.
Now Ac∩Bc means "neither A nor B" =(A∪B)c (De Morgan). Use the complement rule:
P(Ac∩Bc)=1−P(A∪B)=1−0.7=0.3.
Recall Solution 3.2
Why not m/n? Faces are not equally likely, so counting fails — we use the axioms directly.
(a) Normalisation (axiom 2, P(S)=1) and additivity over the six disjoint singletons:
c(1+2+3+4+5+6)=1⇒21c=1⇒c=211.(b) Even faces {2,4,6} are disjoint, so add:
P(even)=c(2+4+6)=2112=74.
Recall Solution 3.3
(a) Empirical: P(H)≈1000620=0.62.(b) For independent events the parent's Independence of Events gives P(H∩H)=P(H)P(H):
P(HH)≈0.62×0.62=0.3844.
Goal: combine counting, complement, and conditional/independence ideas.
Recall Solution 4.1
Direct counting of "at least one" is messy; its complement "no six in any roll" is clean, and rolls are independent so probabilities multiply.
P(no six on one roll)=65.P(no six in four rolls)=(65)4=1296625.P(at least one six)=1−1296625=1296671≈0.5177.
Recall Solution 4.2
Split the event "red" by which urn we used (a disjoint split — Law of Total Probability, built on Conditional Probability & Bayes' Theorem):
P(red)=P(X)P(red∣X)+P(Y)P(red∣Y).
Here P(X)=P(Y)=21, P(red∣X)=53, P(red∣Y)=51:
P(red)=21⋅53+21⋅51=103+101=104=52.
Recall Solution 4.3
All committees equally likely → classical, and we count with Permutations & Combinations. Total committees:
(310)=120.
Complement "no woman" = all 3 from the 6 men:
(36)=20,P(no woman)=12020=61.P(at least one woman)=1−61=65.
Goal: prove a general fact and stress-test degenerate/limiting cases.
Recall Solution 5.1
Start from the exact addition rule (derived in the parent from the axioms):
P(A∪B)=P(A)+P(B)−P(A∩B).
By axiom 1, P(A∩B)≥0. Subtracting a non-negative number can only decrease the total, so:
P(A∪B)=P(A)+P(B)−≥0P(A∩B)≤P(A)+P(B).Equality holds exactly when P(A∩B)=0 — in particular when A and B are disjoint (then axiom 3 gives plain addition). ∎
Recall Solution 5.2
If A⊆B, split B into two disjoint pieces: the part inside A, and the rest.
B=A∪(B∩Ac),A∩(B∩Ac)=∅.
By axiom 3 (disjoint add):
P(B)=P(A)+P(B∩Ac).
Since P(B∩Ac)≥0 (axiom 1), we get P(B)≥P(A). ∎
(This is why bigger events never have smaller probability — a picture: A is a smaller region sitting entirely inside B.)
Recall Solution 5.3
(a)A∪Ac=S, so P(A∪Ac)=P(S)=1 (axiom 2). Always 1, whatever A is.
(b) From monotonicity, A∩B⊆B so P(A∩B)≤P(B). Also A∩B⊇ ... more precisely: B=(A∩B)∪(Ac∩B) disjoint, so P(B)=P(A∩B)+P(Ac∩B). Now Ac∩B⊆Ac and P(Ac)=1−P(A)=0, so by monotonicity P(Ac∩B)=0. Hence
P(A∩B)=P(B).(c) For a single exact point in a continuous space, P({0.5})=0. Yet the dart can land there — so this is a genuine event of probability 0 that is not impossible. The axioms permit P=0 without A=∅ (see the parent's third "steel-manned" mistake).
Recall Self-check summary (reveal after finishing)