The Case Files on Chance
Detective Bayes needs a sharp new partner. Every mystery in this unit is solved with one tool: probability. No tricky math brain required — just careful thinking, one clue at a time.
The Loaded Dice Rumor
A rumor says the dice at the school festival booth are unfair. Before accusing anyone, Detective Bayes needs the basics: what probability actually means, and two simple rules that solve almost every "what are the odds" question.
🔎 The Core Idea
Probability of an event A is just a fraction: how many outcomes make A happen, divided by all possible outcomes (when every outcome is equally likely).
P(A) = n(A) / n(S) , 0 ≤ P(A) ≤ 1S is the sample space — every possible result. n(S) counts all of them.
📏 Two Rules That Solve Everything
Rule 1Complement Rule — "everything except A" always equals 1 minus A.
P(A′) = 1 − P(A)Rule 2Addition Rule — for "A or B", don't double-count the overlap.
P(A ∪ B) = P(A) + P(B) − P(A ∩ B)- If A and B can never happen together (mutually exclusive), then P(A ∩ B) = 0, so P(A ∪ B) = P(A) + P(B).
- "At least one" questions are almost always faster solved using the complement rule.
The Locked Locker Clue
A clue was found — but only if a certain condition is true. Detective Bayes explains that probability can change once you already know something happened. That's conditional probability.
🔎 Conditional Probability
P(A|B) means "the probability of A, given that B has already happened." You shrink the sample space down to just B, then ask how much of that is also A.
P(A|B) = P(A ∩ B) / P(B) (P(B) ≠ 0)Rearranging gives the multiplication rule, useful for "and" questions in sequence:
P(A ∩ B) = P(A) × P(B|A)🤝 Independence
Two events are independent when knowing one happened tells you nothing new about the other — the condition doesn't change anything.
A, B independent ⟺ P(A ∩ B) = P(A) × P(B)- Equivalently: P(A|B) = P(A), and P(B|A) = P(B).
- Drawing with replacement → independent. Drawing without replacement → dependent (the sample space shrinks).
The Fortune Teller's Table
A carnival "fortune wheel" claims to be generous. Detective Bayes builds a table of every possible outcome and its probability — a probability distribution — to reveal the wheel's true average payout.
🔎 Discrete Random Variable
A random variable X assigns a number to each outcome (e.g. "number of heads," "points won"). Its probability distribution lists every value of X with its probability, and all probabilities must add to 1.
| X | x₁ | x₂ | ⋯ | xₙ |
|---|---|---|---|---|
| P(X) | p₁ | p₂ | ⋯ | pₙ |
📐 Expected Value & Variance
Expected value E(X) is the long-run average — a weighted average of every value by its probability.
E(X) = Σ x·P(x)Variance Var(X) measures spread — how far values wander from the mean.
Var(X) = E(X²) − [E(X)]²where E(X²) = Σ x²·P(x). The standard deviation is just σ(X) = √Var(X).
| X | 0 | 1 | 2 |
|---|---|---|---|
| P(X) | 1/4 | 2/4 | 1/4 |
The Repeated Suspects Pattern
The same kind of "trial" repeats over and over — a coin flipped 10 times, a shot attempted 5 times — always with just two outcomes: success or failure. This repeating pattern has a name: the binomial distribution.
🔎 Bernoulli Trial → Binomial
A Bernoulli trial has exactly two outcomes: success (probability p) or failure (probability q = 1 − p). Repeat it n independent times and count the number of successes X — that's a binomial random variable, written X ~ B(n, p).
P(X = k) = C(n, k) · pk · qn−kC(n, k) = n! / [k!(n−k)!] counts how many ways to arrange k successes among n trials.
📐 Shortcut Formulas
No need to sum every term to find the average or spread — binomial has ready-made shortcuts:
E(X) = np · Var(X) = npqThe First Break in the Case
Sometimes what matters isn't "how many successes," but "how long until the very first one." That waiting game is the geometric distribution.
🔎 Waiting for the First Success
Repeat independent trials (success probability p) until the first success appears. Let X = the trial number on which that first success happens.
P(X = k) = qk−1 · p (k = 1, 2, 3, ...)This means: (k−1) failures in a row, then finally one success.
📐 Expected Waiting Time
The average number of trials needed for the first success is simply the reciprocal of p — the rarer the success, the longer the wait.
E(X) = 1 / pDetective Bayes' Case Summary
Every formula from every case, filed in one place. Read this the night before a test — it's your whole unit in one page.
№1 · Basic Probability Rules
P(A) = n(A)/n(S) P(A′) = 1 − P(A) P(A ∪ B) = P(A) + P(B) − P(A ∩ B)№2 · Conditional Probability & Independence
P(A|B) = P(A ∩ B) / P(B) P(A ∩ B) = P(A) × P(B|A) Independent ⟺ P(A ∩ B) = P(A)P(B)№3 · Random Variables
E(X) = Σ x·P(x) Var(X) = E(X²) − [E(X)]² σ(X) = √Var(X)№4 · Binomial Distribution B(n, p)
P(X=k) = C(n,k)·pk·qn−k E(X) = np · Var(X) = npq№5 · Geometric Distribution
P(X=k) = qk−1·p E(X) = 1/p🧭 Detective's Golden Rule
See "or" → think addition rule. See "and," "given," "already know" → think conditional/multiplication rule. See "exactly k out of n" → think binomial. See "until the first" → think geometric. Always check what's independent vs. dependent first — it decides which formula fits.