Probability Formula Sheet
Probability questions in CAT build on counting, so most of the work is getting the favourable and total cases right. Focus on the complement rule, independent events and conditional probability.
Basic rules
| Formula | When to use |
|---|---|
| \(P(E) = \dfrac{\text{favourable outcomes}}{\text{total outcomes}}\), with \(0 \le P(E) \le 1\) | Only when all outcomes are equally likely. |
| \(P(\text{not } E) = 1 - P(E)\) | When the opposite event is easier to count. |
| \(P(A \cup B) = P(A) + P(B) - P(A \cap B)\) | Probability of A or B (or both). |
| \(P(A \cup B) = P(A) + P(B)\) | Only when A and B are mutually exclusive (cannot happen together). |
| \(P(A \cup B \cup C) = P(A) + P(B) + P(C) - P(A \cap B) - P(B \cap C) - P(A \cap C) + P(A \cap B \cap C)\) | Three events that may overlap. |
| Odds in favour \(a : b\) means \(P = \dfrac{a}{a + b}\); odds against \(a : b\) means \(P = \dfrac{b}{a + b}\) | Converting between odds and probability. |
Dependent and independent events
| Formula | When to use |
|---|---|
| \(P(A \cap B) = P(A) \times P(B)\) | Only when A and B are independent (one does not affect the other). |
| \(P(A \mid B) = \dfrac{P(A \cap B)}{P(B)}\) | Probability of A given that B has happened, with \(P(B) > 0\). |
| \(P(A \cap B) = P(A) \times P(B \mid A)\) | Events in sequence, such as drawing without replacement. |
| \(P(A \mid B) = \dfrac{P(B \mid A)\,P(A)}{P(B)}\), where \(P(B) = P(B \mid A)P(A) + P(B \mid A')P(A')\) | Reversing a condition (Bayes' rule), for example "given the ball is red, which bag was it from". |
| \(P(\text{at least one}) = 1 - (1 - p_1)(1 - p_2)\cdots(1 - p_n)\) | Independent events; becomes \(1 - (1 - p)^n\) when all probabilities equal \(p\). |
| \(P(\text{exactly } r \text{ successes}) = \binom{n}{r} p^r (1 - p)^{n - r}\) | \(n\) independent repeated trials, each with the same success probability \(p\). |
| Expected value \(= \sum x_i \, p_i\) | Average outcome of a game or bet with values \(x_i\) and probabilities \(p_i\). |
Standard facts
| Experiment | Fact |
|---|---|
| \(n\) coins tossed | \(2^n\) outcomes; \(P(\text{exactly } r \text{ heads}) = \dfrac{\binom{n}{r}}{2^n}\) |
| \(n\) dice rolled | \(6^n\) outcomes |
| Two dice, sum \(s\) (2 to 12) | \(6 - |s - 7|\) ways out of 36; sum 7 is the most likely, with 6 ways |
| Deck of 52 cards | 4 suits of 13; 26 red and 26 black; 12 face cards (J, Q, K); 4 aces |
Shortcuts and traps
- Exclusive is not independent: two events with non-zero probability that are mutually exclusive cannot be independent, because one happening rules out the other.
- Without replacement: after each draw the total and the favourable count both change; multiply the step-by-step probabilities.
- At least one: use \(1 - P(\text{none})\); adding cases one by one is slow and easy to get wrong.
- Equally likely check: the sums of two dice are not equally likely, so "11 possible sums" does not give a probability of \(\frac{1}{11}\) each.
- Given means shrink: in a conditional question, the "given" event becomes the new total.