MATH U113 · Lesson · before the 7 Oct mid-sem
How to start a probability problem
What to write in the first two minutes, when you've read the question and nothing comes. Four moves that are pure translation, English into symbols. None of them needs an idea. Shown on eight real mid-sem questions, stopping each one exactly where the routine hands over to arithmetic you already know.
1. Following a solution and starting one are two different skills. Reading a worked solution trains the first: you check that each line follows from the one before. Starting trains the second: producing the first line from a blank page. You've practised the first a lot and the second hardly at all, so "I understand it once I see it, but I can't begin" is exactly what that practice history predicts. It says nothing about ability. Classmates who "just see" how to begin have usually done the opening moves hundreds of times; it's a drilled habit, and this page and the start drill exist to drill it.
2. The first moves earn marks by themselves. The mid-sem is a written paper where you show your steps. The 2026 paper's instructions say, word for word: "Answer all parts of the same question together, showing all steps in detail. Specify all distributions properly. Define the event(s) and random variable(s) clearly." Moves 1–3 below are "define the events and random variables" and "specify the distribution". The quiz was fill-in-the-blank with no partial credit; the mid-sem is not.
3. The routine is the same every time, whether the story is shooters, coins, chips or trains. The eight openings below show that.
- The routine
- Word cues → model
- Phrases → symbols
- Shooters
- Two coins
- 30 units
- Particles
- Chips
- Servers
- Battery
- Coin test
- In the exam room
1 · The routine: four moves before any thinking
When you read a question and freeze, the freeze is usually a search for "the idea". The routine replaces that search with four writing jobs. Each one is small, each one is always possible, and after the fourth the problem has turned into a formula with blanks to fill.
Questions come in two kinds, and the routine has a version for each. Event questions talk about things happening or not (a shot hits, a chip is defective, a coin is fair). Random-variable questions talk about a number that varies (the number of defectives, a battery's life in hours, how many heads).
For event questions
- LettersGive every event in the story a capital letter and write what it means in words. A = "X hits the target". If the story has two sources (two machines, two coins), each source gets a letter.
- GivensTurn every number in the question into a P( ) statement. "5% of M₁'s chips are defective" is P(D | M₁) = 0.05 — a percentage "of those that …" is a conditional probability. Words carry givens too: "independently" means P(A ∩ B) = P(A)P(B); "at random, equal probability" means the sources are ½ each.
- TargetTurn the question sentence into P(… | …). What comes after "given that" goes on the right of the bar; what you're asked the probability of goes on the left. If a phrase has no letter yet ("exactly one hit"), give it one now and write what it is in terms of your letters.
- FormulaWrite the definition or rule for your target, with the letters in: P(B | E) = P(B ∩ E) / P(E), or Bayes, or the complement rule. Now every piece is something you can read off a table or a tree.
For random-variable questions
- Name the rvIn words, starting "X = the number of …" or "X = the time until …". Include the unit and the "of what": "X = number of the 4 assigned units that need a speed test".
- Name the distribution, with parameters"X ~ Bin(10, 0.07)", "X ~ Poisson(2)", "X ~ Exp(mean 20 h)". Add a one-line reason from the word cues in the table below ("drawn without replacement from a fixed pool of 30 → hypergeometric"). This line is the "specify all distributions properly" mark.
- Target with the exact inequalityTranslate the words into P(X …) and write the inequality carefully: "at least 3" is X ≥ 3, "less than 700" is X ≤ 699 for a count, "no more than 15 hours" is X ≤ 15.
- FormulaWrite the pmf, cdf or approximation you'll use, with the parameters in: P(X = x) = C(20, x) C(10, 4 − x) / C(30, 4). If the target is "at least one", write the complement here: 1 − P(X = 0).
Many mid-sem questions stack both kinds: an event question whose likelihood comes from a random variable (the chips and servers questions below). Then you run the routine twice, and the second run's answer feeds the first. The servers opening shows it.
2 · Word cues → which model
Move 2 of the random-variable routine is the one people fear, because it feels like it needs judgement. Mostly it doesn't: the question tells you, through a few set phrases. Look for these.
| If the question says… | Reach for | Where it lives |
|---|---|---|
| "drawn / selected / assigned without replacement" from a fixed pool with two kinds | Hypergeometric (N, M, n) | Module 2 models |
| a fixed number n of independent trials, same chance each, count the successes | Binomial Bin(n, p) | Module 2 models |
| a rate "per hour / per square metre / per 60 minutes", count how many | Poisson with mean λ × (length or area) | Module 2 models |
| a mean life or waiting time; "gamma with α = 1"; "still working after …" | Exponential, rate = 1/mean (memoryless) | Module 3 §4.4 |
| a measured quantity with a mean and a standard deviation, "normally distributed" | Normal: standardise z = (x − μ)/σ | Module 3 §4.3 |
| a binomial with large n and the word "approximate", Φ values printed | Normal approximation, ±0.5 continuity correction | Module 3 §4.3 |
| "given that …", "what is the probability that it was …", "which machine / coin / maker" | Conditional probability; Bayes if you're going from effect back to cause | Module 1 §2.4 |
| "at least one", "at least 2 of 10" | Complement: 1 − P(none) or 1 − P(0) − P(1) | Module 1 §2.2 |
3 · Phrases → symbols
Move 3 is translation. This dictionary covers almost every phrase on the three past papers. With letters A, B for two events, or a count X:
| Phrase | Symbols |
|---|---|
| "given that B", "if B has happened", "of those that B" | P(… | B) — B goes right of the bar |
| "A and B", "both" | A ∩ B |
| "A or B", "either", "the target is hit" (by someone) | A ∪ B |
| "not A", "A misses", "fails" | Aᶜ, with P(Aᶜ) = 1 − P(A) |
| "exactly one of A, B" | (A ∩ Bᶜ) ∪ (Aᶜ ∩ B) — the two "one but not the other" pieces |
| "neither", "none" | Aᶜ ∩ Bᶜ, or X = 0 |
| "at least k" / "at most k" | X ≥ k / X ≤ k |
| "more than k" / "less than k" (for a count) | X ≥ k + 1 / X ≤ k − 1 |
| "only 2", "exactly 2" | X = 2 |
| "it was Y's shot", "it was made by M₂", "it is the fair coin" | the source event, left of the bar: P(M₂ | …) |
| "60% of the chips come from M₁" | P(M₁) = 0.6 |
| "5% of its chips are defective" | P(D | M₁) = 0.05 — "of its" is a conditional |
4 · Opening 1 — the two shooters (slowly)
X and Y go target shooting together. Both shoot at a target at the same time. Suppose X hits the target with probability 0.7, whereas Y, independently, hits the target with probability 0.4.
(a) Given that exactly one shot hit the target, what is the probability that it was Y's shot?
(b) Given that the target is hit, what is the probability that Y hit it?
This is the one that felt totally new. Knowing "it's conditional probability" is true but doesn't tell you what to write, so here is what to write, in order. Nothing below needs an idea; each line is a translation of a sentence in the question.
Check yourself first — write moves 1–3 for part (a) on paper, then open
Letters: A = X hits, B = Y hits. Givens: P(A) = 0.7, P(B) = 0.4, independent. Target: P(B | E) with E = exactly one hit. If you got the letters and the givens, you already have two of the four moves.
- LettersA = "X hits the target", B = "Y hits the target". (Not X and Y themselves: those are people, and in this course capital X, Y usually mean random variables. Fresh letters avoid the tangle.)
- GivensP(A) = 0.7, P(B) = 0.4. The word "independently" is a given too: P(A ∩ B) = 0.7 × 0.4 = 0.28. From these, every one of the four "who hit" boxes is a product, so draw the 2×2 table (figure). The four boxes add to 1 — your first in-room check.
- Target(a) "Exactly one shot hit" has no letter yet, so give it one: E = (A ∩ Bᶜ) ∪ (Aᶜ ∩ B). "It was Y's shot" is B. "Given that" puts E on the right: the target is P(B | E).
(b) "The target is hit" means at least one hit: H = A ∪ B. The target is P(B | H). - FormulaThe definition of conditional probability, letters in:
P(B | E) = P(B ∩ E)P(E)
Now read the pieces off the table. B ∩ E means "Y hit, and exactly one hit", so X missed: that's the single box Aᶜ ∩ B = 0.12. E is the two shaded boxes, 0.42 + 0.12. For (b), B sits inside H (if Y hit, the target was hit), so B ∩ H = B and the formula becomes P(B) / P(A ∪ B), where P(A ∪ B) = 1 − 0.18 (everything except "both miss").
Stop here. The rest is one division per part: 0.12 / 0.54 and 0.4 / 0.82. Full solution, answers and traps →
Look at what happened: the "idea" you were waiting for (the 2×2 table, the single box) appeared as a result of writing moves 1–3, not before them. That's the point of the routine.
5 · Opening 2 — the gambler's two coins
(a) A gambler has in his pocket a fair coin and a two-headed coin. He selects one of the coins at random (that is, selects with equal probability), and when he flips it, it shows heads. What is the probability that it is the fair coin?
(b) Suppose that he flips the same coin a second time and again it shows heads. Now what is the probability that it is the fair coin?
(c) Suppose that he flips the same coin a third time and it shows tails. Now what is the probability that it is the fair coin?
Check yourself first — which letters, and which side of the bar does "fair coin" go?
F = fair coin chosen, T = two-headed chosen; evidence = the flips. "What is the probability that it is the fair coin" puts F on the left: P(F | evidence). Effect → cause, so Bayes.
- LettersTwo sources: F = "the fair coin was chosen", T = "the two-headed coin was chosen". Evidence: H₁, H₂ = heads on flip 1, flip 2; T₃ = tails on flip 3.
- Givens"At random (that is, with equal probability)": P(F) = P(T) = ½. What each coin does: P(H | F) = ½, P(H | T) = 1, P(tails | T) = 0. Flips of the same coin are independent once you know which coin, so P(H₁ ∩ H₂ | F) = ¼.
- Target(a) P(F | H₁). (b) P(F | H₁ ∩ H₂). (c) P(F | H₁ ∩ H₂ ∩ T₃). Same shape each time: only the evidence grows.
- FormulaBayes with two sources, evidence e:
P(F | e) = P(e | F) P(F)P(e | F) P(F) + P(e | T) P(T)
Each part is this formula with a different P(e | ·): for (b) it's (½)² versus 1².
Stop here. The rest is fractions: ¼ / (¼ + ½), then the same with ⅛. For (c), notice what P(tails | T) = 0 does. Full solution →
6 · Opening 3 — thirty units, four assigned
Suppose that next month the quality control division will inspect 30 units of a product. Among these, 20 will need a speed test and 10 will be tested for current flow. If an engineer is randomly assigned 4 units without replacement, what are the probabilities that, (a) none of them will need a speed test? (b) only 2 will need a speed test? (c) at least 3 will need a speed test?
This is a random-variable question: it asks "how many".
- Name the rvX = the number of the 4 assigned units that need a speed test.
- DistributionX is hypergeometric with N = 30 units, M = 20 of the "speed test" kind, n = 4 drawn. Reason: "without replacement" from a fixed pool of two kinds (the cue table's first row). Not binomial: each unit taken changes what's left.
- Target(a) "none" → P(X = 0). (b) "only 2" → P(X = 2). (c) "at least 3" → P(X ≥ 3) = P(X = 3) + P(X = 4) (4 is the most possible).
- FormulaChoose which speed-test units and which others, over all ways to choose 4:
P(X = x) = C(20, x) · C(10, 4 − x)C(30, 4)
Stop here. The rest is C(30, 4) = 27 405 and three numerators. Full solution →
7 · Opening 4 — particles on five squares
Cosmic particles fall on a large surface according to a Poisson process with rate λ = 2 particles per square meter. A detector consists of five equal and disjoint square regions, each of area 1 square meter. The number of particles falling on different regions are independent.
(a) What is the probability that in a given region, at most one particle falls?
(b) What is the probability that exactly three of the five regions receive no particles?
Check yourself first — how many random variables does this question have?
Two. One counts particles in one square (Poisson). The other counts how many of the five squares are empty (binomial, because the five squares are independent and each is "empty or not"). Part (b) needs both.
- Name the rvsX = number of particles in one given 1 m² region. For (b), a second one: Y = number of the 5 regions that receive no particles.
- DistributionsX ~ Poisson(λ × area) = Poisson(2 × 1) = Poisson(2) — a rate per square metre, counting how many. Y ~ Bin(5, p₀) with p₀ = P(X = 0): five independent regions (given), each one "empty" or "not empty", same chance each — fixed n, independent, count the successes.
- Target(a) "at most one" → P(X ≤ 1) = P(X = 0) + P(X = 1). (b) "exactly three of the five receive none" → P(Y = 3).
- FormulaP(X = k) = e−2 2k / k!, so p₀ = e−2. Then P(Y = 3) = C(5, 3) p₀³ (1 − p₀)².
Stop here. The rest is 3e−2 and one binomial term. Full solution →
8 · Opening 5 — chips from two machines (22 marks)
🎧 Watch it done first: the narrated walkthrough, Bayes as areas (about 5 min, sound on) acts out the four moves on this question, and pauses three times for your next move.
A factory produces electronic chips from two machines M₁ and M₂.
- Machine M₁ produces 60% of the total chips and 5% of its chips are defective.
- Machine M₂ produces 40% of the total chips and 10% of its chips are defective.
(a) A randomly selected chip from the factory is found to be defective. Find the probability that it was produced by machine M₂.
(b) A machine is selected randomly and a shipment of 100 chips produced by the selected machine is received. From this shipment, 5 chips are selected at random without replacement and tested. It is found that exactly 2 of the selected chips are defective. Assuming that machine M₁ produces 5% defective chips and machine M₂ produces 10% defective chips, find the probability that the selected machine was M₁.
(c) Suppose that chips produced by the factory are inspected independently, and the probability that each chip is defective is equal to the overall defect probability of the factory. If 10 chips are selected at random and inspected independently, find the probability that at most 2 of them are defective.
Three parts, three different openings. Run the routine once per part.
Part (a) — an event question
- LettersM₁, M₂ = "the chip came from machine 1 / 2"; D = "the chip is defective".
- GivensP(M₁) = 0.6, P(M₂) = 0.4. "5% of its chips" is conditional: P(D | M₁) = 0.05, P(D | M₂) = 0.10.
- Target"Found to be defective" is the given; "produced by M₂" is asked: P(M₂ | D).
- FormulaBayes: P(M₂ | D) = P(D | M₂)P(M₂) / [P(D | M₁)P(M₁) + P(D | M₂)P(M₂)]. The denominator is P(D), the factory's overall defect rate — keep it, part (c) needs it.
Part (b) — an event question whose likelihood is a random variable
- Letters and rvSame M₁, M₂ — but now for "which machine was selected". X = number of defective chips among the 5 tested.
- Givens"A machine is selected randomly" → P(M₁) = P(M₂) = ½. This is a new prior: the 60/40 was about chips, not about picking a machine. Given M₁, the shipment of 100 has 5 defectives, so X | M₁ is hypergeometric (N = 100, M = 5, n = 5) — "without replacement" again. Given M₂: 10 defectives, M = 10.
- TargetThe evidence is X = 2: P(M₁ | X = 2).
- FormulaThe same Bayes shape as (a), with likelihoods from the hypergeometric: P(X = 2 | M₁) = C(5, 2) C(95, 3) / C(100, 5) and P(X = 2 | M₂) = C(10, 2) C(90, 3) / C(100, 5).
Part (c) — a random-variable question
- Name the rvY = number of defective chips among the 10 inspected.
- DistributionY ~ Bin(10, p) with p = P(D) from part (a): 10 chips, inspected independently, same chance each.
- Target"At most 2" → P(Y ≤ 2) = P(0) + P(1) + P(2).
- FormulaP(Y = k) = C(10, k) pk (1 − p)10 − k.
Stop here. Each part is now arithmetic. Full solution, and the two misreadings that give wrong answers →
9 · Opening 6 — the servers (14 marks, three routines stacked)
A data center sources its server racks from two manufacturers: Enigma-1 and Enigma-2. The probabilities of selecting Enigma-1 and Enigma-2 are 0.8 and 0.2 respectively. The failure time of the servers produced by both the manufacturers follow an Exponential distribution. The specifications of items produced by the two manufacturers are given below:
- Enigma-1: Mean Failure Time of 12,000 hours.
- Enigma-2: Mean Failure Time of 5,000 hours.
A technician selects a random rack of n = 10 servers, all belonging to the same manufacturer. After a period of t = 1,500 hours, it is observed that at least 2 servers have failed. Assuming that the servers fail independently of each other, calculate the posterior probability that the racks were manufactured by Enigma-2.
This looks like the hardest question on the paper, and it's the one where the routine helps most, because it breaks into three small openings you've already seen. Work from the question sentence backwards.
- Letters (the outer event question)E₁, E₂ = "the rack is from Enigma-1 / Enigma-2". A = "at least 2 of the 10 servers have failed by 1 500 h". Givens: P(E₁) = 0.8, P(E₂) = 0.2. Target: "posterior probability … Enigma-2" is P(E₂ | A). Formula: Bayes, which needs P(A | E₁) and P(A | E₂). Those are the two gaps; the next moves fill them.
- Inner rv: one server's lifeT = failure time of one server, hours. Given E₁, T ~ Exp(mean 12 000), rate 1/12 000. Target: p₁ = P(T ≤ 1 500 | E₁), the chance one server has failed by then. Formula: 1 − e−t/mean. Same for E₂ with mean 5 000.
- Inner rv: how many of the tenN = number of the 10 servers failed by 1 500 h. Given the maker, N ~ Bin(10, pi): ten servers, fail independently (given), same chance each. A = {N ≥ 2}, and "at least" → complement: P(A | Ei) = 1 − P(N = 0) − P(N = 1).
- Formula, assembledPut the two likelihoods from move 3 into the Bayes formula from move 1. Everything is now defined, and the answer is arithmetic.
Stop here. Full solution with every number →
10 · Opening 7 — the battery
Battery life between charges for a certain mobile phone is 20 hours on an average when the primary use is talk time, and drops to 7 hours when the phone is primarily used for internet applications over a cellular network. Assume that the battery life in both cases follows a gamma distribution with α = 1.
(a) What is the probability that the battery charge for a randomly selected phone will last no more than 15 hours when its primary use is talk time?
(b) A battery manufacturer of phone which is primarily used for internet applications claims that the life time of their batteries follows a distribution mentioned above. If you have been using this battery for 5 hours and it is still functioning, then find the probability that it will last atleast for another 3 hours?
- Name the rvsX = battery life in hours, talk-time use. Y = battery life in hours, internet use.
- Distributions"Gamma with α = 1" is the exponential (cue table, row 4). "20 hours on an average" is the mean, so X ~ Exp(mean 20), rate 1/20; Y ~ Exp(mean 7), rate 1/7.
- Target(a) "no more than 15 hours" → P(X ≤ 15). (b) "used for 5 hours and still functioning" is the given, Y > 5; "at least another 3 hours" means lasting to 5 + 3 = 8 hours in total: P(Y ≥ 8 | Y > 5).
- Formula(a) cdf 1 − e−x/20. (b) The definition P(Y ≥ 8 ∩ Y > 5) / P(Y > 5) = P(Y ≥ 8)/P(Y > 5), which memorylessness shortens to P(Y ≥ 3). Writing the definition first earns the marks even if you forget the shortcut.
Stop here. Full solution →
11 · Opening 8 — testing the coin 1 000 times
Two types of coins are produced at a factory: a fair coin and a biased one that comes up heads 55 percent of the time. We have one of these coins, but do not know whether it is a fair coin or a biased one. In order to ascertain which type of coin we have, we shall perform the following statistical test: We shall toss the coin 1000 times. If the coin lands on heads 525 or more times, then we shall conclude that it is a biased coin, whereas if it lands on heads less than 525 times, then we shall conclude that it is a fair coin. If the coin is actually fair, what is the approximate probability that we shall reach a false conclusion?
Check yourself first — "false conclusion" means what, in symbols?
The coin is fair, so the false conclusion is "biased", which happens when heads ≥ 525. Target: P(X ≥ 525) with X ~ Bin(1000, 0.5). The 55% never enters: "if the coin is actually fair" tells you which coin to use.
- Name the rvX = number of heads in the 1 000 tosses.
- Distribution"If the coin is actually fair": X ~ Bin(1000, 0.5) — 1 000 independent tosses, same chance, count heads. "Approximate" with n this large, and a Φ value printed on the paper → normal approximation with μ = np = 500, σ = √(npq) = √250.
- TargetA false conclusion for a fair coin is concluding "biased", which the test does when heads is 525 or more: P(X ≥ 525).
- FormulaContinuity correction: the count 525 is the bar from 524.5 to 525.5, so P(X ≥ 525) ≈ 1 − Φ((524.5 − 500)/√250). That z rounds to 1.55 — exactly the Φ value the paper prints, which confirms you're on the right track.
Stop here. Full solution →
12 · In the exam room
The 30-second routine, on every question
- First pass, all questions, 1–2 minutes each: write the letters, the givens and the target for every question before solving any. This is the "define the events and random variables" work, it's worth marks, and it shows you which question you're most sure of.
- Start with the question you're most confident about, not Q1. Early marks steady the hand.
- If you're stuck after move 4, draw it: a tree for two sources, a 2×2 table for two events, a number line for a count or a time. The picture usually shows you the missing piece.
- Move on after 10 minutes without progress on a part, and come back with fresh eyes. Your moves 1–3 are already on the page, earning marks.
- Keep unrounded values on the calculator; round to 4 decimal places only at the end.
This routine also works on the fear. Blank-page panic comes from waiting for an idea with nothing to do while you wait. With the routine there is always a next line to write, and writing it is progress. By the time the four lines are down, the question has usually turned into one you recognise.
If the fear ever feels bigger than ordinary exam nerves, the campus counselling service is there for exactly that, and plenty of first-years use it.
The skill is trained by producing openings, not reading them. Use the start drill (eight openings a day, about two minutes each), or ask an AI to coach you without solving:
"I'm studying probability from Devore 9th ed., chapters 2–4. Give me one exam-style word problem. Don't solve it. Ask me for four things one at a time: (1) letters for the events or a named random variable, (2) every number written as a P( ) statement or a named distribution with parameters, (3) the target written as P( | ) or P(X …), (4) the formula I'd use. Wait for my answer after each step and tell me only whether it's right and why, then ask for the next."
"Here is a question from my mid-sem paper: [paste it]. Don't give me the solution. Ask me what the random variable is and what its distribution is, then check my answer and give me a hint only if I'm wrong."
AI answers can contain confident arithmetic errors — check any final number against the PYQ page.