← Mathematics syllabus

Mathematics · Module 4

12 lessons · 48 problems

Probability & Statistics — full chapter

Learn each idea, drill it with Basic → Intermediate → Advanced problems, and finish with mixed practice. Every problem shows its thinking right after you answer.

12

lessons

48

practice problems

16

key formulas

0

answered · 0 correct

After this chapter you can

  • Compute classical probabilities from a correctly counted sample space.
  • Choose permutations vs combinations by asking whether order matters.
  • Use complements for at-least-one phrasing (E1-48 zodiac pattern).
  • Apply the addition rule, subtracting overlaps except when mutually exclusive.
  • Condition with P(A∣B)=P(A∩B)P(B)P(A|B) = \frac{P(A \cap B)}{P(B)} after shrinking the space.
  • Test independence with the product rule; never multiply dependent draws.
  • Solve urn-count systems like E3-48 and weight cases with total probability.
  • Pick mean/median/mode to fit the data, ordering values for any median.
  • Report variance vs standard deviation with correct units.
  • Read frequency tables and charts literally; flag missing data (E2-47) instead of inventing it.

How to study this chapter

  1. Learn lessons 1–4: sample spaces, counting, complements, addition.
  2. Drill Basic practice, then read every trap you hit.
  3. Learn lessons 5–7: conditioning, independence, urn systems.
  4. Drill Intermediate practice, including the E1-48 and E3-48 patterns.
  5. Learn lessons 8–12: centers, spread, tables, charts, mixed tactics.
  6. Finish Advanced practice, then answer the 3 previous exam questions.

Lessons

Lesson 1 of 12

Sample Spaces and Classical Probability

Learn the idea

List all equally-likely outcomes first: that list is the sample space Ω\Omega. Then P(A)=∣A∣∣Ω∣P(A) = \frac{|A|}{|\Omega|}.
Classical probability needs EQUAL likelihood. A fair die has 6; two dice have 3636 pairs — count, never guess.
Every probability lives in [0,1][0, 1]: P(∅)=0P(\varnothing) = 0, P(Ω)=1P(\Omega) = 1. Outside that range, you slipped.

Key rules to memorize

  1. P(A)=∣A∣∣Ω∣P(A) = \frac{|A|}{|\Omega|} over equally-likely outcomes
  2. Die: ∣Ω∣=6|\Omega| = 6; two dice: ∣Ω∣=36|\Omega| = 36 ordered pairs
  3. 0≤P(A)≤10 \le P(A) \le 1; P(∅)=0P(\varnothing) = 0, P(Ω)=1P(\Omega) = 1
  4. Partition check: probabilities over all cases sum to 11
  5. Favourable means counted inside Ω\Omega, not wished for

Worked example

One fair die: P(even)=P(\text{even}) = ?

  1. Ω={1,2,3,4,5,6}\Omega = \{1,2,3,4,5,6\}, favourable {2,4,6}\{2,4,6\}.
  2. P=36P = \frac{3}{6}.

12\frac{1}{2}

Classic trap

Dividing by the wrong total, e.g. P(even)=35P(\text{even}) = \frac{3}{5} on a die: the total is 66, so 36=12\frac{3}{6} = \frac{1}{2}.

Lesson 2 of 12

Permutations vs Combinations

Learn the idea

Ask one question before any factorial: does ORDER matter? Lineups and codes use permutations A(n,k)A(n,k); teams and subsets use combinations C(n,k)C(n,k).
Order-irrelevant selection overcounts by k!k!: dividing it out turns A(n,k)A(n,k) into C(n,k)C(n,k).
Mirror shortcut: C(n,k)=C(n,n−k)C(n,k) = C(n,n-k). Choosing 2 to keep equals choosing 3 to leave.

Key rules to memorize

  1. Order matters ⇒A(n,k)=n!/(n−k)!\Rightarrow A(n,k) = n!/(n-k)!
  2. Order irrelevant ⇒C(n,k)=n!/(k!(n−k)!)\Rightarrow C(n,k) = n!/(k!(n-k)!)
  3. C(n,k)=C(n,n−k)C(n,k) = C(n,n-k); C(n,0)=C(n,n)=1C(n,0) = C(n,n) = 1
  4. Team/committee wording ⇒\Rightarrow combinations (never permute people into seats)
  5. Arrangement/ranking/password wording ⇒\Rightarrow permutations

Worked example

From 5 people choose a 2-person team. How many?

  1. Order irrelevant: C(5,2)=5!/(2!⋅3!)C(5,2) = 5!/(2! \cdot 3!).
  2. Compute 202\frac{20}{2}.

1010

Classic trap

Permuting a team: C(5,2)=10C(5,2) = 10, not A(5,2)=20A(5,2) = 20. Order never matters among teammates.

Lesson 3 of 12

Complements and At-Least-One

Learn the idea

P(Ac)=1−P(A)P(A^{c}) = 1 - P(A). When the direct count explodes, count the opposite and subtract from 11.
The phrase AT LEAST ONE is the complement signal: P(at least one)=1−P(none)P(\text{at least one}) = 1 - P(\text{none}).
Exam proof (E1-48): three zodiac animals — all-different is easy, so 1−12⋅11⋅10123=17721 - 12 \cdot 11 \cdot \frac{10}{12^{3}} = \frac{17}{72}.

Key rules to memorize

  1. P(Ac)=1−P(A)P(A^{c}) = 1 - P(A)
  2. P(at least one)=1−P(none)P(\text{at least one}) = 1 - P(\text{none})
  3. E1-48: P(all differ)=12⋅11⋅10123=5572P(\text{all differ}) = 12 \cdot 11 \cdot \frac{10}{12^{3}} = \frac{55}{72}
  4. E1-48 answer: 1−5572=17721 - \frac{55}{72} = \frac{17}{72} (option A)
  5. Use complements before inclusion-exclusion whenever you see ≥1\ge 1

Worked example

Zodiac: P(at least two of three share an animal)=P(\text{at least two of three share an animal}) = ?

  1. P(all differ)=12⋅11⋅10123=5572P(\text{all differ}) = 12 \cdot 11 \cdot \frac{10}{12^{3}} = \frac{55}{72}.
  2. Complement: 1−55721 - \frac{55}{72}.

1772\frac{17}{72}

Classic trap

Computing at-least-one directly case by case (1 match + 2 matches + 3 matches). One subtraction replaces all three cases.

Lesson 4 of 12

Addition Rule and Mutual Exclusivity

Learn the idea

General rule: P(A∪B)=P(A)+P(B)−P(A∩B)P(A \cup B) = P(A) + P(B) - P(A \cap B). The overlap was counted twice — subtract it once.
Mutually exclusive means P(A∩B)=0P(A \cap B) = 0: then simply add. Die faces are the classic case.
Overlap traps (heart-king, red-face) are where the −P(A∩B)- P(A \cap B) term earns its mark.

Key rules to memorize

  1. P(A∪B)=P(A)+P(B)−P(A∩B)P(A \cup B) = P(A) + P(B) - P(A \cap B)
  2. Mutually exclusive: P(A∩B)=0⇒P(A \cap B) = 0 \Rightarrow add directly
  3. Die: P(1 or 6)=16+16=13P(1 \text{ or } 6) = \frac{1}{6} + \frac{1}{6} = \frac{1}{3}
  4. Cards: P(heart or king)=1352+452−152=1652=413P(\text{heart or king}) = \frac{13}{52} + \frac{4}{52} - \frac{1}{52} = \frac{16}{52} = \frac{4}{13}
  5. Never add overlapping events without subtracting the intersection

Worked example

P(A)=0.4P(A) = 0.4, P(B)=0.5P(B) = 0.5, P(A∩B)=0.2P(A \cap B) = 0.2: P(A∪B)=P(A \cup B) = ?

  1. Add then subtract overlap: 0.4+0.5−0.20.4 + 0.5 - 0.2.
  2. Simplify.

0.70.7

Classic trap

Adding 1352+452=1752\frac{13}{52} + \frac{4}{52} = \frac{17}{52} for heart-or-king: the king of hearts sits in both — subtract it once for 1652=413\frac{16}{52} = \frac{4}{13}.

Lesson 5 of 12

Conditional Probability

Learn the idea

P(A∣B)=P(A∩B)P(B)P(A|B) = \frac{P(A \cap B)}{P(B)}: restrict the world to BB, then measure AA inside it.
Shrink the sample space first. A die given EVEN leaves {2,4,6}\{2,4,6\} — 3 outcomes, not 6.
Direction matters: P(A∣B)≠P(B∣A)P(A|B) \ne P(B|A). Divide by the probability of the GIVEN condition.

Key rules to memorize

  1. P(A∣B)=P(A∩B)P(B)P(A|B) = \frac{P(A \cap B)}{P(B)}
  2. Restrict Ω\Omega to BB first, count AA inside
  3. Die given even, P(>3)=23P(> 3) = \frac{2}{3} ({4,6}\{4,6\} of {2,4,6}\{2,4,6\})
  4. P(A∣B)P(A|B) divides by P(B)P(B); P(B∣A)P(B|A) divides by P(A)P(A)
  5. Without replacement, the condition is the shrunken bag

Worked example

Fair die, given the result is even: P(>3)=P(> 3) = ?

  1. Restricted space: {2,4,6}\{2,4,6\}.
  2. Favourable inside it: {4,6}\{4,6\}, so 23\frac{2}{3}.

23\frac{2}{3}

Classic trap

Keeping 6 outcomes after being told EVEN: the space shrank to 3 — P(>3∣even)=23P(>3|\text{even}) = \frac{2}{3}, not 26\frac{2}{6}.

Lesson 6 of 12

Independence and the Product Rule

Learn the idea

Test, never assume: independent   ⟺  P(A∩B)=P(A)⋅P(B)\iff P(A \cap B) = P(A) \cdot P(B). Seeming unrelated is not a proof.
Independent events multiply across trials: two coins give P(HH)=12×12=14P(HH) = \frac{1}{2} \times \frac{1}{2} = \frac{1}{4}.
Mutually exclusive (with positive probability) means DEPENDENT: if AA happened, BB cannot.

Key rules to memorize

  1. Independent   ⟺  P(A∩B)=P(A)⋅P(B)\iff P(A \cap B) = P(A) \cdot P(B)
  2. Across independent trials, multiply: P(6,6)=136P(6,6) = \frac{1}{36}
  3. Never multiply for dependent draws (no replacement) — condition instead
  4. Mutually exclusive + P>0P > 0 ⇒\Rightarrow dependent, not independent
  5. P(A)=0.3P(A) = 0.3, P(B)=0.4P(B) = 0.4 independent ⇒P(A∩B)=0.12\Rightarrow P(A \cap B) = 0.12

Worked example

P(A)=0.3P(A) = 0.3, P(B)=0.4P(B) = 0.4, independent: P(A∩B)=P(A \cap B) = ?

  1. Independence licenses the product.
  2. Compute 0.3×0.40.3 \times 0.4.

0.120.12

Classic trap

Multiplying dependent draws: bag 3R2B3R2B, P(RR)P(RR) without replacement is 35×24=310\frac{3}{5} \times \frac{2}{4} = \frac{3}{10}, not 925\frac{9}{25}.

Lesson 7 of 12

Urn Systems and Total Probability

Learn the idea

Exam proof (E3-48): 12 balls, P(R)=13P(R) = \frac{1}{3} so R=4R = 4; Y+G=5Y+G = 5, B+Y=5B+Y = 5, total 1212 forces G=3G = 3, Y=2Y = 2, B=3B = 3.
Turn each probability into a COUNT first (multiply by the total), then solve the little system.
Split-sample extension: P(A)=∑P(A∣Bi)P(Bi)P(A) = \sum P(A|B_{i})P(B_{i}) — weight each case by how likely the case is.

Key rules to memorize

  1. Counts first: P×P \times total == count
  2. E3-48: R=4R = 4, G=3G = 3, Y=2Y = 2, B=3B = 3
  3. E3-48 answers: P(Y)=16P(Y) = \frac{1}{6}, P(B)=14P(B) = \frac{1}{4}, P(G)=14P(G) = \frac{1}{4} (option A)
  4. Total probability: P(A)=∑P(A∣Bi)P(Bi)P(A) = \sum P(A|B_{i})P(B_{i})
  5. Bayes flips the condition: P(B∣A)=P(A∣B)P(B)P(A)P(B|A) = \frac{P(A|B)P(B)}{P(A)}

Worked example

12 balls: P(R)=13P(R) = \frac{1}{3}, P(Y or G)=512P(Y \text{ or } G) = \frac{5}{12}, P(B or Y)=512P(B \text{ or } Y) = \frac{5}{12}: find P(Y)P(Y).

  1. Counts: R=4R = 4; Y+G=5Y+G = 5; B+Y=5B+Y = 5; total 1212 gives G=3G = 3, Y=2Y = 2, B=3B = 3.
  2. So P(Y)=212P(Y) = \frac{2}{12}.

16\frac{1}{6}

Classic trap

Reading P(yellow or green)=512P(\text{yellow or green}) = \frac{5}{12} as P(Y)=512P(Y) = \frac{5}{12}: it is a SUM — split it with the total-count system.

Lesson 8 of 12

Mean, Median and Mode

Learn the idea

Mean uses EVERY value (xˉ=∑xn\bar{x} = \frac{\sum x}{n}) — efficient but dragged by outliers. Median uses ORDER only — robust.
Sort first, always: odd nn takes the middle value; even nn averages the middle two.
Mode is the most frequent value. A dataset can have no mode, one mode, or several.

Key rules to memorize

  1. Mean xˉ=∑xn\bar{x} = \frac{\sum x}{n}
  2. Median (odd nn): the n+12\frac{n+1}{2}-th ordered value
  3. Median (even nn): average of the two middle ordered values
  4. Mode: most frequent (may not exist, or tie)
  5. Example: 2,4,4,9⇒2,4,4,9 \Rightarrow mean 4.754.75, median 44, mode 44

Worked example

Mean and median of 2,4,4,92, 4, 4, 9.

  1. Mean: 2+4+4+94=194=4.75\frac{2+4+4+9}{4} = \frac{19}{4} = 4.75.
  2. Ordered already; median =4+42= \frac{4+4}{2}.

Mean 4.754.75; median 44

Classic trap

Median of unsorted data, or averaging ALL values for even nn: only the middle two get averaged.

Lesson 9 of 12

Variance and Standard Deviation

Learn the idea

Variance averages SQUARED deviations: σ2=∑(x−xˉ)2n\sigma^{2} = \frac{\sum(x-\bar{x})^{2}}{n}. Squaring punishes far values.
Standard deviation σ=variance\sigma = \sqrt{\text{variance}} restores the data's own units — report σ\sigma when units are asked.
σ=0\sigma = 0 exactly when all values are identical; otherwise bigger σ\sigma means wider spread.

Key rules to memorize

  1. σ2=∑(x−xˉ)2n\sigma^{2} = \frac{\sum(x-\bar{x})^{2}}{n}
  2. σ=σ2\sigma = \sqrt{\sigma^{2}} (same units as the data; variance is squared units)
  3. σ=0  ⟺  \sigma = 0 \iff all values identical
  4. Example: 1,2,3⇒1,2,3 \Rightarrow mean 22, variance 23\frac{2}{3}, σ=2/3\sigma = \sqrt{2/3}
  5. Range =max⁡−min⁡= \max - \min is the quick spread check

Worked example

Data 1,2,31, 2, 3: population variance?

  1. Mean =2= 2; squared deviations 1,0,11, 0, 1.
  2. Average: 1+0+13\frac{1+0+1}{3}.

23\frac{2}{3}

Classic trap

Giving variance with data units: variance is SQUARED units — take the root for σ\sigma before attaching cmcm, kgkg, etc.

Lesson 10 of 12

Frequency Tables and Grouped Means

Learn the idea

Grouped mean weights by frequency: xˉ=∑fixi∑fi\bar{x} = \frac{\sum f_{i}x_{i}}{\sum f_{i}}. Divide by total FREQUENCY, not by group count.
Expand the table on scrap: 0,0,1,1,1,2,…0,0,1,1,1,2,\ldots — then median and mode are read-offs.
Range from a table is still max-value minus min-value, frequencies aside.

Key rules to memorize

  1. xˉ=∑fixi∑fi\bar{x} = \frac{\sum f_{i}x_{i}}{\sum f_{i}}
  2. Denominator is total frequency ∑fi\sum f_{i}
  3. Example: 0(2),1(3),2(5)⇒xˉ=1310=1.30(2), 1(3), 2(5) \Rightarrow \bar{x} = \frac{13}{10} = 1.3
  4. Median position: odd n→n+12n \to \frac{n+1}{2}-th; even n→n \to middle-two average
  5. Mode of a table: the value with the largest ff

Worked example

Scores 00(freq 2), 11(freq 3), 22(freq 5): mean?

  1. Total =0⋅2+1⋅3+2⋅5=13= 0 \cdot 2 + 1 \cdot 3 + 2 \cdot 5 = 13; students =10= 10.
  2. Divide: 1310\frac{13}{10}.

1.31.3

Classic trap

Dividing by 3 groups instead of 10 students: 133\frac{13}{3} is wrong — 1310=1.3\frac{13}{10} = 1.3.

Lesson 11 of 12

Reading Charts and the E2-47 Warning

Learn the idea

Read literally first: are entries COUNTS or PERCENTAGES? Check axes, units, and the total before any computation.
Pie: sector ×\times total; bars: read heights, then sum for shares. Convert only at the end.
Exam warning (E2-47): the running-apps survey gave NO preference numbers, so no probability exists — mark unsolvable, never invent data.

Key rules to memorize

  1. Counts vs percentages: confirm before computing
  2. Pie 25%25\% of 1200=3001200 = 300
  3. Bars 5,8,12⇒5, 8, 12 \Rightarrow total 2525, shares 525,825,1225\frac{5}{25}, \frac{8}{25}, \frac{12}{25}
  4. E2-47: no distribution stated ⇒\Rightarrow answer −1-1 (disputed source)
  5. Inventing numbers is always wrong — flag missing data instead

Worked example

Survey names no app-preference counts. P(two picked differ)=P(\text{two picked differ}) = ?

  1. No distribution ⇒\Rightarrow no sample space.
  2. Cannot be computed from the stem.

Unsolvable as written (source issue)

Classic trap

Computing 2380\frac{23}{80} or 5780\frac{57}{80} for E2-47 from thin air: with no distribution given, the only honest answer is unsolvable.

Lesson 12 of 12

Mixed Exam Tactics and Bounds Checks

Learn the idea

Close every question with a bounds check: probabilities in [0,1][0,1], case-probabilities summing to 11, σ≥0\sigma \ge 0.
Skewed data with outliers wants the MEDIAN as center; symmetric clean data is fine with the mean.
Two dice sums to memorize: P(sum 7)=636=16P(\text{sum } 7) = \frac{6}{36} = \frac{1}{6}, P(sum 9)=436=19P(\text{sum } 9) = \frac{4}{36} = \frac{1}{9}.

Key rules to memorize

  1. Bounds: 0≤P≤10 \le P \le 1; partition sums to 11
  2. E3-48 check: 13+16+14+14=1\frac{1}{3}+\frac{1}{6}+\frac{1}{4}+\frac{1}{4} = 1 ✓\checkmark
  3. Outlier present ⇒\Rightarrow median; symmetric ⇒\Rightarrow mean is fine
  4. P(sum 7)=16P(\text{sum } 7) = \frac{1}{6}; P(sum 9)=19P(\text{sum } 9) = \frac{1}{9}
  5. Syllabus time targets: probability 75s75s, statistics 70s70s per question

Worked example

Two dice: P(sum=9)=P(\text{sum} = 9) = ?

  1. Pairs: (3,6),(4,5),(5,4),(6,3)(3,6),(4,5),(5,4),(6,3) — 4 of 36.
  2. Simplify 436\frac{4}{36}.

19\frac{1}{9}

Classic trap

Reporting 1.21.2 or −0.3-0.3 as a probability and moving on: bounds-check every final number.

Master formula sheet

Classical

  • P(A)=∣A∣∣Ω∣P(A) = \frac{|A|}{|\Omega|} (equally-likely Ω\Omega)
  • 0≤P(A)≤10 \le P(A) \le 1; P(∅)=0P(\varnothing) = 0, P(Ω)=1P(\Omega) = 1
  • P(Ac)=1−P(A)P(A^{c}) = 1 - P(A); P(at least one)=1−P(none)P(\text{at least one}) = 1 - P(\text{none})

Counting

  • A(n,k)=n!/(n−k)!A(n,k) = n!/(n-k)! — order matters
  • C(n,k)=n!/(k!(n−k)!)C(n,k) = n!/(k!(n-k)!) — order irrelevant
  • C(n,k)=C(n,n−k)C(n,k) = C(n,n-k); C(n,0)=C(n,n)=1C(n,0) = C(n,n) = 1

Combine & condition

  • P(A∪B)=P(A)+P(B)−P(A∩B)P(A \cup B) = P(A) + P(B) - P(A \cap B)
  • Mutually exclusive: P(A∩B)=0⇒P(A∪B)=P(A)+P(B)P(A \cap B) = 0 \Rightarrow P(A \cup B) = P(A) + P(B)
  • P(A∣B)=P(A∩B)P(B)P(A|B) = \frac{P(A \cap B)}{P(B)}
  • Independent: P(A∩B)=P(A)⋅P(B)P(A \cap B) = P(A) \cdot P(B)
  • Total: P(A)=∑P(A∣Bi)P(Bi)P(A) = \sum P(A|B_{i})P(B_{i}); Bayes: P(B∣A)=P(A∣B)P(B)P(A)P(B|A) = \frac{P(A|B)P(B)}{P(A)}

Statistics

  • Mean xˉ=∑xn\bar{x} = \frac{\sum x}{n}; grouped xˉ=∑fixi∑fi\bar{x} = \frac{\sum f_{i}x_{i}}{\sum f_{i}}
  • Median: odd n→n+12n \to \frac{n+1}{2}-th ordered; even n→n \to middle-two average
  • Mode: most frequent value
  • Variance σ2=∑(x−xˉ)2n\sigma^{2} = \frac{\sum(x-\bar{x})^{2}}{n}; σ=σ2\sigma = \sqrt{\sigma^{2}}
  • Range =max⁡−min⁡= \max - \min; σ=0  ⟺  \sigma = 0 \iff all values identical

Traps & recognition

12 classic traps

  1. Wrong total in P(A)P(A): die even is 36=12\frac{3}{6} = \frac{1}{2}, not 35\frac{3}{5}.
  2. Permuting a team: C(5,2)=10C(5,2) = 10, not A(5,2)=20A(5,2) = 20.
  3. Case-bashing at-least-one instead of one complement subtraction (E1-48).
  4. Forgetting −P(A∩B)-P(A \cap B): heart-or-king is 1652=413\frac{16}{52} = \frac{4}{13}, not 1752\frac{17}{52}.
  5. Conditioning without shrinking: P(>3∣even)=23P(>3|\text{even}) = \frac{2}{3}, not 26\frac{2}{6}.
  6. Multiplying dependent draws: no-replacement P(RR)=35×24P(RR) = \frac{3}{5} \times \frac{2}{4}.
  7. Mutually exclusive ≠\ne independent (positive probabilities are dependent).
  8. Reading P(Y or G)=512P(Y \text{ or } G) = \frac{5}{12} as P(Y)P(Y): split the system (E3-48).
  9. Unsorted median, or averaging all values for even nn.
  10. Variance in data units: root it for σ\sigma; divide grouped means by ∑f\sum f.
  11. Inventing E2-47 numbers: no distribution means unsolvable — flag it.
  12. Probabilities outside [0,1][0,1]: bounds-check every answer.

Fast problem recognition

  • Favourable over total

    Verify equal likelihood, count ∣Ω∣|\Omega|, then ∣A∣∣Ω∣\frac{|A|}{|\Omega|}. Bounds-check [0,1][0,1].

  • Choose / team / committee

    Order irrelevant →C(n,k)\to C(n,k); arrangements / ranks / codes →A(n,k)\to A(n,k).

  • At least one

    Complement at once: 1−P(none)1 - P(\text{none}). E1-48 zodiac is the model.

  • Or with overlap

    Add then subtract the intersection; add directly only if mutually exclusive.

  • Given / knowing that

    Shrink to the given set, then P(A∩B)P(B)\frac{P(A \cap B)}{P(B)}.

  • Two trials / with replacement

    Test independence; if independent, multiply.

  • Balls with or-probabilities

    Convert to counts (P×P \times total), solve the system — E3-48 pattern.

  • Mean / median / mode

    Sort first; even nn averages the middle two; outliers →\to median.

Practice — 48 problems

0/0 correct

  1. PP-C-01basic · prob-sample-space
    One fair die: P(even)=P(\text{even}) =
  2. PP-C-02basic · prob-sample-space
    Two fair coins: P(at least one head)=P(\text{at least one head}) =
  3. PP-C-03basic · prob-sample-space
    One card from 52: P(ace)=P(\text{ace}) =
  4. PP-C-04basic · prob-sample-space
    P(∅)=P(\varnothing) =
  5. PP-C-05basic · prob-counting
    C(5,2)=C(5,2) =
  6. PP-C-06basic · prob-counting
    A(5,2)=A(5,2) =
  7. PP-C-07basic · prob-counting
    C(6,4)=C(6,4) =
  8. PP-C-08basic · prob-counting
    Choose a 3-person team from 8 (order irrelevant): how many?
  9. PP-C-09basic · prob-complement
    Zodiac: P(at least two of three share an animal)=P(\text{at least two of three share an animal}) =
  10. PP-C-10basic · prob-complement
    P(none)=14P(\text{none}) = \frac{1}{4}: P(at least one)=P(\text{at least one}) =
  11. PP-C-11basic · prob-complement
    Die rolled 3 times: P(at least one 6)=P(\text{at least one } 6) =
  12. PP-C-12basic · prob-complement
    P(A)=0.3P(A) = 0.3: P(Ac)=P(A^{c}) =
  13. PP-C-13basic · prob-addition
    Die: P(1 or 6)=P(1 \text{ or } 6) =
  14. PP-C-14basic · prob-addition
    P(A)=0.4P(A) = 0.4, P(B)=0.5P(B) = 0.5, P(A∩B)=0.2P(A \cap B) = 0.2: P(A∪B)=P(A \cup B) =
  15. PP-C-15basic · prob-addition
    Mutually exclusive A,BA, B: P(A)=0.5P(A) = 0.5, P(B)=0.3P(B) = 0.3: P(A∪B)=P(A \cup B) =
  16. PP-C-16basic · prob-addition
    Card: P(heart or king)=P(\text{heart or king}) =
  17. PP-C-17intermediate · prob-conditional
    Die, given even: P(>3)=P(> 3) =
  18. PP-C-18intermediate · prob-conditional
    P(A∩B)=0.2P(A \cap B) = 0.2, P(B)=0.5P(B) = 0.5: P(A∣B)=P(A|B) =
  19. PP-C-19intermediate · prob-conditional
    Bag 3R2B3R2B, first drawn red (kept out): P(second red)=P(\text{second red}) =
  20. PP-C-20intermediate · prob-conditional
    P(A∩B)=0.12P(A \cap B) = 0.12, P(B)=0.3P(B) = 0.3: P(A∣B)=P(A|B) =
  21. PP-C-21intermediate · prob-independence
    Two fair coins: P(HH)=P(HH) =
  22. PP-C-22intermediate · prob-independence
    Independent A,BA, B: P(A)=0.3P(A) = 0.3, P(B)=0.4P(B) = 0.4: P(A∩B)=P(A \cap B) =
  23. PP-C-23intermediate · prob-independence
    Mutually exclusive A,BA, B with positive probabilities are
  24. PP-C-24intermediate · prob-independence
    Die twice: P(both 6)=P(\text{both } 6) =
  25. PP-C-25intermediate · prob-urn-systems
    E3-48 balls: P(yellow)=P(\text{yellow}) =
  26. PP-C-26intermediate · prob-urn-systems
    E3-48 balls: P(black)=P(\text{black}) =
  27. PP-C-27intermediate · prob-urn-systems
    E3-48 balls: P(green)=P(\text{green}) =
  28. PP-C-28intermediate · prob-urn-systems
    Urn I (1R2B)(1R2B), urn II (2R1B)(2R1B), urn picked fairly: P(R)=P(R) =
  29. PP-C-29intermediate · stat-centers
    Mean of 2,4,4,9=2, 4, 4, 9 =
  30. PP-C-30intermediate · stat-centers
    Median of 2,4,4,9=2, 4, 4, 9 =
  31. PP-C-31intermediate · stat-centers
    Mode of 1,2,2,3,3,3=1, 2, 2, 3, 3, 3 =
  32. PP-C-32intermediate · stat-centers
    Median of 5,1,4=5, 1, 4 =
  33. PP-C-33advanced · stat-spread
    Population variance of 1,2,3=1, 2, 3 =
  34. PP-C-34advanced · stat-spread
    Std dev of 1,2,3=1, 2, 3 =
  35. PP-C-35advanced · stat-spread
    σ=0\sigma = 0 means
  36. PP-C-36advanced · stat-spread
    Range of 2,4,4,9=2, 4, 4, 9 =
  37. PP-C-37advanced · stat-tables
    Scores 00(2), 11(3), 22(5): mean =
  38. PP-C-38advanced · stat-tables
    Same table: total frequency =
  39. PP-C-39advanced · stat-tables
    Same table: range =
  40. PP-C-40advanced · stat-tables
    Same table: median =
  41. PP-C-41advanced · stat-charts
    Running-apps survey (E2-47, no counts given): P(two picked differ)=P(\text{two picked differ}) =
  42. PP-C-42advanced · stat-charts
    Pie sector 25%25\% of 12001200 students =
  43. PP-C-43advanced · stat-charts
    Bars 5,8,125, 8, 12: total =
  44. PP-C-44advanced · stat-charts
    Heavily skewed data with outliers: best center is the
  45. PP-C-45advanced · prob-stat-mixed
    Which cannot be a probability?
  46. PP-C-46advanced · prob-stat-mixed
    E3-48 colour probabilities sum to
  47. PP-C-47advanced · prob-stat-mixed
    Two dice: P(sum=9)=P(\text{sum} = 9) =
  48. PP-C-48advanced · prob-stat-mixed
    Two dice: P(sum=7)=P(\text{sum} = 7) =

Previous CSCA exam questions

Real questions from the Dec 2025, Jan 2026 and Apr 2026 papers that test this chapter — solved with the thinking shown. This chapter has 3 probability questions (E1-48, E2-47, E3-48) and 0 statistics questions so far, which is why the lessons teach the full syllabus, not just past papers. Answers solved by the app (the source papers publish no official key); items with source errors are marked and still teach the correct math.

3 exam questions · 0/0 correct

  1. Dec 2025 · Q48probability
    Zodiac: P(at least two of three share an animal) =
  2. Jan 2026 · Q47probabilitysource issue
    Running apps survey: P(two picked students prefer different apps) =

    No correct option in the source paper

    Source issue: the question states no app-preference numbers — unsolvable as written.

    Correct math

    No preference distribution is given, so the probability cannot be computed.

    Full solution — 3 steps

    1. The question states no app-preference numbers.
    2. Without a distribution no probability can be computed.
    3. Source issue — unsolvable as written.
  3. Apr 2026 · Q48probability
    12 balls: P(red)=1/3, P(yellow or green)=5/12, P(black or yellow)=5/12: P(yellow, black, green) =

Exam checklist

0/10 checked

Probability

Statistics

One-minute memory sheet

  • Order? Teams CC, lineups AA.
  • At least one =1−P(none)= 1 - P(\text{none}): zodiac 1772\frac{17}{72}.
  • Or means minus overlap: heart-king 413\frac{4}{13}.
  • Given shrinks the space: even →23\to \frac{2}{3}.
  • Independent multiplies; exclusive adds; never both.
  • Balls: counts first — R4R4, Y2Y2, B3B3, G3G3.
  • Sort before median; even nn averages two.
  • Variance squared, σ\sigma plain; ∑f\sum f divides.

Related guides

Last reviewed Sep 2026 · GetCSCA editors