Binomial coefficient C(n,k) = n! / (k!(nโk)!)
Number of ways to choose k out of n. Pascal's triangle computes it without factorials.
The formula
Read as โ choose โ. The number of combinations of items chosen from (no order, no repetition).
Special cases
- (one way to choose nothing)
- (one way to choose everything)
Symmetry
Ex: . Choosing 3 is the same as leaving out 7.
Pascalโs triangle
Each number is the sum of the two above:
n=0: 1
n=1: 1 1
n=2: 1 2 1
n=3: 1 3 3 1
n=4: 1 4 6 4 1
n=5: 1 5 10 10 5 1
Application: binomial theorem
For : (coefficients 1, 2, 1).
For : (coefficients 1, 3, 3, 1).
Application: combinations in probability
Number of 5-card hands from 52:
Common mistakes
- Confusing combination and arrangement (arrangement = with order).
- Forgetting the in the denominator.
- Computing huge factorials instead of simplifying (e.g., ).
C(6, 2) = ?
Mini-quiz
Question 1 / 3C(5, 2) = ?
