Probability formulas: solve for the missing chance
Why this matters
Every probability formula can be asked backward. A test report gives P(positive | sick), but you want the base rate. A game's average is known, but one payout is missing. A system must be 99% reliable, and you need the number of checks. Each is a transposition with the moves you know, plus one new condition: the answer must be a chance, between 0 and 1.
- Turn the complement, "and", "or" and Bayes rules around for any chance, the prior and the likelihood included
- Free a chance that appears twice in the total-probability rule by expanding, collecting and dividing
- Rearrange expected value, variance, binomial and z-score formulas, and choose the root that fits
- Solve pⁿ ≥ target for n with logs, flipping the sign because ln p is negative
- Check that every answer lies between 0 and 1, with exact fractions and a seeded simulation
The math: run each rule backward
Purpose. Make any chance in a probability formula the subject, and check the answer can be a chance.
Each rule from the probability module turns around with the four moves of lesson 30:
| Rule | Turned around |
|---|---|
| P(not A) = 1 − P(A) | P(A) = 1 − P(not A) |
| P(A and B) = P(A) × P(B given A) | P(B given A) = P(A and B) ÷ P(A) |
| P(A or B) = P(A) + P(B) − P(A and B) | P(A and B) = P(A) + P(B) − P(A or B) |
| P(A given B) = P(B given A) × P(A) ÷ P(B) | P(A) = P(A given B) × P(B) ÷ P(B given A) |
P(B | A) is read "the chance of B given A", as in lesson 90. In Bayes' rule, P(A) is the prior: the chance before any evidence. P(B | A) is the likelihood: the chance of the evidence if A is true. Either can be the subject, so P(B | A) = P(A | B) × P(B) ÷ P(A) too.
Conditions. Divide only by a chance above 0. And every answer must land from 0 to 1. Say P(A) = 0.5, P(B) = 0.4 and P(A or B) = 0.95. The overlap comes out as −0.05, so these three numbers can't all be true. That's a check on the data, not a rounding slip.