EN FR

PR-2 Solutions: Conditional Probability

Solutions Reference · ← Back to Lesson PR-2

Section 5 — Guided Practice Solutions

GP1 — Reading Conditional Probability from a Two-Way Table

For every variant: (a) the denominator of \( P(A \mid B) \) is always the marginal total for B — the row or column total for the conditioning event, not the grand total and not the intersection cell. (b) the conditional probability is the intersection cell divided by that marginal total.

Variant 0 — Study location × quiz result (n = 120)

Passes quizDoes not passTotal
Library481260
Elsewhere362460
Total8436120

Variant 1 — Transportation × on-time arrival (n = 200)

On timeLateTotal
Public transit7248120
Drives562480
Total12872200

Variant 2 — Membership type × weekly frequency (n = 150)

3+ times/weekLess frequentTotal
Student member543690
Non-student243660
Total7872150

Variant 3 — Diet type × energy level (n = 100)

High energyLow energyTotal
Vegetarian281240
Non-vegetarian362460
Total6436100

Variant 4 — Work status × course completion (n = 200)

Completes on timeDoes not completeTotal
Works full-time4872120
Not full-time562480
Total10496200

GP2 — General Multiplication Rule (Generator)

Generated by generateMultiplicationRuleProblem(). The approach for every instance:

Example: \( P(B) = 0.40 \), \( P(A \mid B) = 0.25 \).

\[ P(A \cap B) = 0.40 \times 0.25 = 0.10 \]

Common distractors and why they are wrong:


GP3 — Tree Diagram Path Probability (Generator)

Generated by generateTreeDiagramProblem(). The approach for every instance:

Example: \( P(\text{Stage 1} = X) = 0.60 \), \( P(\text{Stage 2} = Y \mid X) = 0.20 \).

\[ P(X \cap Y) = 0.60 \times 0.20 = 0.12 \]

Common distractors and why they are wrong:


GP4 — Independence Analysis (non-regenerable)

Data: 200 students. Video games: 90 play regularly. Exercise: 80 exercise regularly. Both: 36.

Part (a):

\[ P(\text{video games} \cap \text{exercise}) = \frac{36}{200} = 0.18 \]

Part (b) — Multiplication test:

\[ P(\text{video games}) = \frac{90}{200} = 0.45, \quad P(\text{exercise}) = \frac{80}{200} = 0.40 \] \[ P(\text{video games}) \cdot P(\text{exercise}) = 0.45 \times 0.40 = 0.18 = P(\text{both}) \]

The product equals the joint probability exactly. The events are independent. This is the surprising result — intuition might expect gamers to exercise less, but the data say otherwise.

Part (c) — Conditional probability confirmation:

\[ P(\text{video games} \mid \text{exercise}) = \frac{36}{80} = 0.45 = P(\text{video games}) \]

Knowing a student exercises gives no additional information about whether they play video games. Independence confirmed.

Part (d) — Evaluating the classmate's claims:

Section 6 — Independent Practice Solutions

IP1 — Two Conditional Probabilities from a Table

For every variant: compute both \( P(A \mid B) \) and \( P(B \mid A) \) separately. They share the same numerator (the intersection cell) but different denominators. They are generally not equal — only when \( P(A) = P(B) \).

Variant 0 — Vitamins × colds (n = 200)

Fewer coldsNormal/moreTotal
Takes vitamins7248120
No vitamins364480
Total10892200

Variant 1 — Fiction reading × stress (n = 150)

Lower stressNormal/highTotal
Reads fiction453075
No fiction304575
Total7575150

Variant 2 — Bike commute × on-time arrival (n = 200)

On timeLateTotal
Bikes562480
Does not bike7248120
Total12872200

Variant 3 — Part-time work × car ownership (n = 150)

Owns a carNo carTotal
Part-time362460
Not part-time543690
Total9060150

Variant 4 — Planner app × deadline adherence (n = 200)

Meets all deadlinesMisses one+Total
Uses planner6040100
No planner4060100
Total100100200

IP2 — Total Probability from a Tree Diagram (Generator)

Generated by generateTotalProbabilityProblem(). The approach for every instance:

  1. Identify the target Stage-2 outcome (e.g., "defective").
  2. Multiply along each path that leads to that outcome: \( P(\text{path}) = P(\text{Stage-1 branch}) \times P(\text{Stage-2 branch} \mid \text{Stage-1}) \).
  3. Sum all such paths: \( P(\text{target}) = \sum_i P(\text{path}_i) \).

Example: Three suppliers A, B, C with proportions 0.25, 0.35, 0.40 and defect rates 0.20, 0.10, 0.30.

SupplierP(supplier)P(defect | supplier)Joint
A0.250.200.25 × 0.20 = 0.050
B0.350.100.35 × 0.10 = 0.035
C0.400.300.40 × 0.30 = 0.120
\[ P(\text{defective}) = 0.050 + 0.035 + 0.120 = 0.205 \]

IP3 — Independence Test from Given Probabilities

For every variant: apply the multiplication test \( P(A) \cdot P(B) \overset{?}{=} P(A \cap B) \). Then confirm by computing \( P(A \mid B) = P(A \cap B) / P(B) \) and comparing to \( P(A) \).

Variant 0 — Premium coffee × car ownership

Variant 1 — Reads news × votes

Variant 2 — Streaming × live sports

Variant 3 — Exercises 3+/week × sleeps 7+ hours

Variant 4 — Budgeting app × debt-free


IP4 — Find the Error

Variant 0 — Doctor's claim (reversed conditioning)

Error: The doctor stated \( P(\text{positive} \mid \text{disease}) = 0.90 \) (sensitivity) but claimed it equals \( P(\text{disease} \mid \text{positive}) \). These two conditionals have different denominators — one restricts to diseased patients, the other to patients who tested positive. For a rare disease, the false-positive pool can dwarf the true-positive pool, making \( P(\text{disease} \mid \text{positive}) \) dramatically lower than 0.90 even with a highly sensitive test.

No numerical correction is possible without the base rate (prevalence).

Variant 1 — Wrong denominator

Error: The student used \( P(S) = 1 \) as the denominator instead of \( P(B) = 0.40 \).

Correct calculation:

\[ P(A \mid B) = \frac{P(A \cap B)}{P(B)} = \frac{0.12}{0.40} = 0.30 \]

Using \( P(S) = 1 \) as denominator gives \( P(A \cap B) \), not \( P(A \mid B) \).

Variant 2 — Independence assumed without testing

Error: The student applied the simplified multiplication rule \( P(A \cap B) = P(A) \cdot P(B) \) without first verifying independence.

Independence test: \( P(\text{on time}) \cdot P(\text{bus}) = 0.65 \times 0.30 = 0.195 \neq 0.25 = P(\text{on time} \cap \text{bus}) \).

The events are dependent. The correct joint probability is 0.25 (from the table), not 0.195.

Variant 3 — Assumed symmetry of conditioning

Error: The student correctly computed \( P(B \mid A) = 0.42 \) but then claimed \( P(A \mid B) = 0.42 \) "by symmetry."

The two conditionals share the numerator \( P(A \cap B) \) but have different denominators — \( P(B) \) for \( P(A \mid B) \) and \( P(A) \) for \( P(B \mid A) \). They are equal only when \( P(A) = P(B) \).

Correct result: \( P(A \mid B) = 0.28 \) (given in the problem). Always compute each direction separately.

Variant 4 — Mutual exclusivity confused with independence

Error: The student concluded independence from \( P(A \cap B) = 0 \) (mutual exclusivity). This is backwards — mutually exclusive events with positive probability are always dependent.

\[ P(A \mid B) = \frac{P(A \cap B)}{P(B)} = \frac{0}{P(B)} = 0 \neq P(A) \]

Since \( P(A \mid B) = 0 \neq P(A) \), the events are dependent. Knowing \( B \) occurred makes \( A \) impossible — the most extreme form of dependence, not independence.


IP5 — Multi-Step Synthesis (non-regenerable)

Data: 500 customers. Loyalty card: 300 yes, 200 no. Repeat purchase: 180 yes, 320 no. Both (loyalty AND repeat): 150.

Part (a) — Complete the 2×2 table:

Repeat purchaseNo repeatTotal
Loyalty card150150300
No loyalty card30170200
Total180320500

Loyalty card, no repeat = 300 − 150 = 150. No loyalty, repeat = 180 − 150 = 30.

Part (b) — Two conditional probabilities:

\[ P(\text{repeat} \mid \text{loyalty}) = \frac{150}{300} = 0.50 \] \[ P(\text{repeat} \mid \text{no loyalty}) = \frac{30}{200} = 0.15 \]

These differ substantially — loyalty card holders repurchase at 3.3× the rate of non-holders.

Part (c) — Independence test:

\[ P(\text{repeat}) \cdot P(\text{loyalty}) = \frac{180}{500} \times \frac{300}{500} = 0.36 \times 0.60 = 0.216 \] \[ P(\text{repeat} \cap \text{loyalty}) = \frac{150}{500} = 0.30 \]

\( 0.216 \neq 0.30 \) → the events are DEPENDENT.

Part (d) — Reversed conditional probabilities:

\[ P(\text{loyalty} \mid \text{repeat}) = \frac{150}{180} \approx 0.833 \] \[ P(\text{repeat} \mid \text{loyalty}) = \frac{150}{300} = 0.50 \]

These are not equal (0.833 ≠ 0.50). They share numerator 150 but use different denominators (180 repeat purchasers vs. 300 loyalty card holders). This is a concrete example of C8 — asymmetry of conditioning.

Part (e) — Evaluating the manager vs. analyst:

Section 7 — Mastery Check Solutions

Question 1 — Feynman Test (Model Answer)

See the model answer block in the lesson for the full explanation. The key ideas:

\[ P(\text{disease} \mid \text{positive}) = \frac{180}{670} \approx 0.27 \]

Compare: \( P(\text{positive} \mid \text{disease}) = 0.90 \) vs. \( P(\text{disease} \mid \text{positive}) \approx 0.27 \). The difference is 0.63 — far greater than 0.50. The reason: disease is rare (base rate 2%), so false positives (490) far outnumber true positives (180), diluting the positive predictive value.


Question 2 — Two-Stage Quality Control

Stage 1 catches 85% of defectives. Stage 2 catches 70% of the defectives that reach it. 4% of items are defective.

(a) A tree diagram is the most appropriate tool — sequential stages with conditional probabilities at each branch. Answer: tree diagram.

(b) Tree for a defective item:

Stage 1PStage 2P (given passed S1)Joint (defective path)
Caught0.850.85
Passes0.15Caught0.700.15 × 0.70 = 0.105
Passes0.15Passes0.300.15 × 0.30 = 0.045

\( P(\text{passes both} \mid \text{defective}) = 0.15 \times 0.30 = 0.045 \)

\[ P(\text{defective AND passes both}) = P(\text{defective}) \times P(\text{passes both} \mid \text{defective}) = 0.04 \times 0.045 = \mathbf{0.0018} \]

(c) The two stages are dependent. Stage 2 only acts on items that passed Stage 1 — it operates on a restricted subpopulation. The conditional probability \( P(\text{caught at Stage 2} \mid \text{defective, passed Stage 1}) = 0.70 \) cannot equal the unconditional probability of being caught at Stage 2 across all defectives, because Stage 2 never sees items removed at Stage 1.


Question 3 — Error Analysis

The student applied \( P(A \cap B) = P(A) \cdot P(B) = 0.35 \times 0.40 = 0.14 \) because "there's no reason these would be related."

Specific error: Applied the simplified multiplication rule without first testing independence. "No reason to be related" is a contextual judgment, not a mathematical test.

Correct procedure:

  1. Compute \( P(A) \cdot P(B) = 0.35 \times 0.40 = 0.14 \).
  2. Compare to the actual \( P(A \cap B) = 0.20 \) (from data).
  3. Since \( 0.14 \neq 0.20 \), the events are dependent.

The correct joint probability is 0.20 — read from the data. The formula \( P(A) \cdot P(B) \) is only valid after independence is confirmed; it cannot replace actual data.

Section 8 — Boss Fight Solutions

Path A — The Medical Analyst

Scenario: rare condition affecting 2% of the population. Sensitivity = \( P(\text{positive} \mid \text{disease}) = 0.90 \). Specificity = \( P(\text{negative} \mid \text{no disease}) = 0.95 \), so \( P(\text{positive} \mid \text{no disease}) = 0.05 \).

Task 1 — Complete tree (per 10,000 people):

Stage 1 (Disease status)PStage 2 (Test result)P (conditional)Joint probability
Has disease (200 people)0.02Positive0.900.02 × 0.90 = 0.018
Has disease (200 people)0.02Negative0.100.02 × 0.10 = 0.002
No disease (9,800 people)0.98Positive0.050.98 × 0.05 = 0.049
No disease (9,800 people)0.98Negative0.950.98 × 0.95 = 0.931

Check: 0.018 + 0.002 + 0.049 + 0.931 = 1.000 ✓

Task 2 — \( P(\text{tests positive}) \):

Two paths lead to a positive test: (has disease AND positive) and (no disease AND positive).

\[ P(\text{positive}) = 0.018 + 0.049 = 0.067 \]

Task 3 — \( P(\text{disease} \mid \text{positive}) \):

\[ P(\text{disease} \mid \text{positive}) = \frac{P(\text{disease} \cap \text{positive})}{P(\text{positive})} = \frac{0.018}{0.067} \approx \mathbf{0.269} \]

Compare to the 90% sensitivity: a test with 90% sensitivity gives only ~27% probability that a positive result reflects true disease. This is surprising because the disease is rare (2% base rate) — even with low false-positive rate (5%), the 9,800 healthy people generate 490 false positives, which swamp the 180 true positives (200 × 0.90). Base rate dominates.

Task 4 — \( P(\text{disease} \mid \text{negative}) \):

\[ P(\text{negative}) = 0.002 + 0.931 = 0.933 \] \[ P(\text{disease} \mid \text{negative}) = \frac{0.002}{0.933} \approx 0.0021 \]

A negative test result is very reassuring — only about 0.2% of people who test negative actually have the condition. The test's 90% sensitivity means it misses 10% of true cases (20 out of 200), but that is a small absolute number compared to the 9,310 true negatives.

Key insight: For rare conditions, even accurate tests have high false-positive rates in absolute terms. Positive predictive value (\( P(\text{disease} \mid \text{positive}) \)) depends critically on the base rate — screening programs for rare diseases typically require confirmatory testing precisely for this reason.


Path B — The Policy Analyst

Scenario: 5,000 records. Young drivers (≤25): 1,500. Older drivers (>25): 3,500. Accidents: 320 total (180 young, 140 older). Company claims young-driver status and accident are independent.

Task 1 — Multiplication test:

\[ P(\text{young}) = \frac{1500}{5000} = 0.30, \quad P(\text{accident}) = \frac{320}{5000} = 0.064 \] \[ P(\text{young}) \cdot P(\text{accident}) = 0.30 \times 0.064 = 0.0192 \] \[ P(\text{young} \cap \text{accident}) = \frac{180}{5000} = 0.036 \]

\( 0.0192 \neq 0.036 \) → the events are DEPENDENT. The independence claim is false.

Task 2 — Conditional probability comparison:

\[ P(\text{accident} \mid \text{young}) = \frac{180}{1500} = 0.120 \] \[ P(\text{accident} \mid \text{older}) = \frac{140}{3500} = 0.040 \]

The accident rate for young drivers (12.0%) is three times that for older drivers (4.0%). These conditional probabilities are far from equal — confirming dependence. If the events were independent, both rates would equal the overall rate (6.4%).

Task 3 — Consequence of incorrect independence assumption:

When the company applies \( P(\text{young} \cap \text{accident}) = P(\text{young}) \cdot P(\text{accident}) = 0.0192 \), it underestimates the true joint risk (0.036) by a factor of nearly 2. In insurance pricing: underestimating risk means collecting insufficient premiums from the high-risk group (young drivers), which creates an actuarial shortfall. The company effectively subsidizes young-driver risk through other policyholders.

Task 4 — Comparison of correct vs. incorrect joint probability:

Section 9 — Challenge Problem Solutions

Challenge 1 — Algebraic Derivation

Part (a) — Derive the General Multiplication Rule:

Start from the conditional probability formula:

\[ P(A \mid B) = \frac{P(A \cap B)}{P(B)} \]

Multiply both sides by \( P(B) \):

\[ P(B) \cdot P(A \mid B) = P(A \cap B) \]

This is the General Multiplication Rule: \( P(A \cap B) = P(B) \cdot P(A \mid B) \). ✓

Part (b) — Derive the Simplified Multiplication Rule:

If \( A \) and \( B \) are independent, then by definition \( P(A \mid B) = P(A) \). Substitute into the General Rule:

\[ P(A \cap B) = P(B) \cdot P(A \mid B) = P(B) \cdot P(A) = P(A) \cdot P(B) \]

This is the Simplified Multiplication Rule for independent events: \( P(A \cap B) = P(A) \cdot P(B) \). ✓

Part (c) — Independence in a tree diagram:

If Stage 1 and Stage 2 are independent, the conditional probabilities on Stage 2 branches are the same regardless of which Stage 1 branch was taken. Stage 2 has "no memory" of Stage 1 — the branch probabilities at each Stage 2 node are identical. Formally: \( P(B \mid A) = P(B \mid A') = P(B) \) for any Stage 2 event \( B \).


Challenge 2 — Redundant Inspection Systems

Each of three independent inspectors misses a defect with probability 0.15.

Part (a) — P(all three miss):

By independence, multiply the individual miss probabilities:

\[ P(\text{all miss}) = 0.15 \times 0.15 \times 0.15 = (0.15)^3 = 0.003375 \]

Part (b) — P(at least one catches):

Use the complement rule — "at least one catches" is the complement of "all miss":

\[ P(\text{at least one catches}) = 1 - P(\text{all miss}) = 1 - 0.003375 = \mathbf{0.996625} \]

Part (c) — Minimum inspectors to get P(all miss) < 0.001:

Answer: 4 inspectors. The minimum to achieve \( P(\text{all miss}) \lt 0.001 \) is \( n = 4 \).


Challenge 3 — Conditional Probability Across Three Groups (Generator)

Generated by generateThreeGroupCondProbProblem(). The approach for any instance:

  1. Within each group: compute the conditional probability as (intersection cell) / (row total for that group).
  2. Compare across groups: identify which group has the highest or lowest conditional probability.
  3. Reversed direction: to find \( P(\text{group} \mid \text{outcome}) \), use the same intersection cell but divide by the column total for the outcome.

The key insight: \( P(\text{outcome} \mid \text{group}) \) and \( P(\text{group} \mid \text{outcome}) \) use the same intersection cell but different denominators. The group with the highest forward conditional rate is not necessarily the group that "dominates" among people with that outcome — that depends on group size.