A system of parts in series fails when its first part fails; a job finishes when its slowest worker does. These are the minimum and the maximum of several random variables. With independence and CDFs both have neat formulas, and the minimum of exponential times is exponential again.
Key idea
Why it works
Worked examples
Worked example: Dice
- $P(\max \le 4) = \left(\frac{4}{6}\right)^{3} = \frac{8}{27}$.
- $$P(\max = 4) = P(\max \le 4) - P(\max \le 3) = \frac{8}{27} - \frac{1}{8} = \frac{37}{216}$$
Answer: $\frac{8}{27}$ and $\frac{37}{216}$
Worked example: The largest of n uniforms
- $F_{\max}(x) = x^{n}$, so the density is $nx^{n - 1}$ on $[0, 1]$.
- $E[\max] = \int_{0}^{1} x \cdot nx^{n - 1}\,dx = \frac{n}{n + 1}$. Similarly $E[\min] = \frac{1}{n + 1}$.
- The $n$ points split $[0, 1]$ into $n + 1$ gaps of equal average length.
Answer: $\frac{n}{n + 1}$
Worked example: Parts in series
- Rates: $\frac{1}{4}$ and $\frac{1}{12}$ per year; total $\frac{1}{3}$.
- The device's lifetime is exponential with rate $\frac{1}{3}$: mean 3 years.
- The first part fails first with probability $\frac{1/4}{1/3} = \frac{3}{4}$.
Answer: 3 years; $\frac{3}{4}$
The exponential case has a memorable form. Think of independent alarm clocks ringing at exponential times. The first ring comes at rate $\lambda_1 + \cdots + \lambda_n$, so the chance that all of them are still silent at time $t$ is $e^{-(\lambda_1 + \cdots + \lambda_n)t}$, and clock $i$ rings first with probability equal to its share of the total rate. After the first ring the others start fresh, because exponentials have no memory.
Common mistake