Permutations (order matters): ${}^nP_r = \dfrac{n!}{(n-r)!}$
Combinations (order doesn't matter): $\dbinom{n}{r} = {}^nC_r = \dfrac{n!}{r!(n-r)!}$
Key identity: $\dbinom{n}{r} = \dbinom{n}{n-r}$ (choosing $r$ to include = choosing $n-r$ to exclude)
Pascal's identity: $\dbinom{n}{r} = \dbinom{n-1}{r-1} + \dbinom{n-1}{r}$
Use permutations when arrangement matters (e.g., PIN codes, rankings). Use combinations when only selection matters (e.g., committee formation, card hands). Multiply counting steps that are independent (Multiplication Principle).
Bayes' theorem updates the probability of an event given new evidence. It combines prior probabilities with conditional probabilities.
$$P(A_i \mid B) = \frac{P(B \mid A_i)\,P(A_i)}{\displaystyle\sum_j P(B \mid A_j)\,P(A_j)}$$
The denominator is $P(B)$ computed by the law of total probability: $$P(B) = P(B|A)P(A) + P(B|A')P(A')$$
A disease affects 1% of the population. A test is 95% sensitive (correct positive if diseased) and 90% specific (correct negative if healthy). A patient tests positive. What is the probability they have the disease?
For a discrete random variable $X$ with $P(X=x_i) = p_i$:
$E(X) = \mu = \displaystyle\sum x_i p_i$
$E(X^2) = \displaystyle\sum x_i^2 p_i$
$\operatorname{Var}(X) = \sigma^2 = E(X^2) - [E(X)]^2$
$\operatorname{SD}(X) = \sigma = \sqrt{\operatorname{Var}(X)}$
| $x$ | 1 | 2 | 3 | 4 |
|---|---|---|---|---|
| $P(X=x)$ | 0.1 | 0.4 | 0.3 | 0.2 |
Models the number of independent events occurring in a fixed interval, at an average rate $\lambda$.
$$P(X = k) = \frac{\lambda^k e^{-\lambda}}{k!}, \quad k = 0, 1, 2, \ldots$$
$E(X) = \lambda$, $\operatorname{Var}(X) = \lambda$ (mean equals variance — key property!)
(a) $P(\text{both red}) = \dfrac{3}{10} \times \dfrac{2}{9} = \dfrac{6}{90} = \dfrac{1}{15}$
(b) $P(\text{at least one red}) = 1 - P(\text{both blue}) = 1 - \dfrac{7}{10}\cdot\dfrac{6}{9} = 1 - \dfrac{42}{90} = \dfrac{48}{90} = \dfrac{8}{15}$
$P(\text{both red} \mid \text{at least one red}) = \dfrac{1/15}{8/15} = \dfrac{1}{8}$
$P(X \le 2) = P(0)+P(1)+P(2) = e^{-5}\left(\dfrac{5^0}{0!}+\dfrac{5^1}{1!}+\dfrac{5^2}{2!}\right) = e^{-5}(1+5+12.5) = 18.5e^{-5} \approx 0.1247$
$\sum p = k(1+2+3+4) = 10k = 1 \Rightarrow k = 0.1$.
$E(X) = 0.1(1+4+9+16) = 3$. $E(X^2) = 0.1(1+8+27+64) = 10$. $\operatorname{Var}(X) = 10-9 = 1$.