Study guides / QNT: Quant Interviews / Probability & combinatorics
Probability & combinatorics
QNT: Quant Interviews · quick review
Count outcomes carefully, then divide. Most interview probability questions reduce to counting or to the complement rule.
The rules
- Equally likely outcomes: P(event) = favorable outcomes ÷ total outcomes.
- Combinations ignore order: C(n, k) = n! ÷ (k!(n − k)!). Permutations count order: n! ÷ (n − k)!.
- Repeated items: arrangements of a word divide n! by the factorial of each repeated letter's count.
- Complement rule: P(at least one) = 1 − P(none). It's usually much easier than adding cases.
- Without replacement, multiply conditional probabilities: the second draw's odds depend on the first.
Formulas
- Combinations: C(n, k) = n! ÷ (k! × (n − k)!)
- Permutations: P(n, k) = n! ÷ (n − k)!
- At least one: 1 − P(none)
Common traps
- Counting ordered outcomes when order doesn't matter, or the reverse.
- Treating sums of two dice as equally likely; 7 is six times as likely as 2.
- Forgetting that draws without replacement change the odds.
How it's tested
Dice, cards and coins questions open most quant interviews and online tests.
Practise it
The full lesson, worked examples and practice questions are in Tickmark, where every answer choice is explained.
Open the full lesson