Two dice. Probability the sum equals 7? Enumerate 36 outcomes. Three dice: 216. Ten dice: 60 billion. Convolution gives the exact distribution of the sum of independent random variables, no approximation. On FAM, problems are designed for hand computation.
HIGH-FREQUENCY: Discrete convolution for two independent random variables is the most testable form on FAM.
If and are independent discrete random variables:
Sum over all where both terms are positive.
KEY: Convolution requires independence. You can only use when and are independent. Without independence, you need the joint distribution.
For three or more variables, iterate: compute first, then add .
With random , condition first:
Common mistakes
- Forgetting contributions from multiple values of . arises from and . Missing the term gives 0.090 instead of 0.139.
- Omitting the term. When , there is a point mass at . Forgetting it makes probabilities sum to less than 1.
- Double-counting symmetric pairs. (1, 3) and (3, 1) are different events (count both. But (2, 2) is one event) do not count twice.
Bottom line
- Discrete convolution:
- Convolution yields exact distributions with no approximation, unlike normal or lognormal methods.
- For more variables: convolve iteratively, first , then add .
- Collective risk model: condition on , then compute the n-fold convolution for each .
Exam shortcut
If the question asks for a single , enumerate only the pairs that produce . Do not compute the full distribution. If the question asks for or the complete distribution, build the table from smallest to largest and verify the total is 1. "Slide and multiply" (fix one row, slide the other, multiply aligned entries. "Condition, convolve, combine") the three C's for compound distributions.
The full lesson (about 1,335 words, 9 min read) adds 2 worked examples, all 5 common mistakes, a self-check, free in the app.
Learning objectives
- 2k
Browse all free Exam FAM lessons or jump into free Exam FAM practice questions.