The Multinomial Theorem
What you'll learn: You'll discover how to expand expressions with more than two terms raised to a power, using multinomial coefficients to count all the ways terms can combine.
The Core Idea
The Binomial Theorem let you expand (a + b)ⁿ efficiently. But what if you have three, four, or k terms instead? That's where the Multinomial Theorem comes in.
When you expand (x₁ + x₂ + ... + xₖ)ⁿ, you're multiplying n copies of this sum together and collecting like terms. Each term in the expansion looks like:
x₁^(r₁) · x₂^(r₂) · ... · xₖ^(rₖ)
where the exponents r₁, r₂, ..., rₖ are non-negative integers that add up to n (since you're picking one term from each of the n factors).
The Formula
The Multinomial Theorem states:
(x₁ + x₂ + ... + xₖ)ⁿ = Σ [n!/(r₁!r₂!...rₖ!)] · x₁^(r₁) · x₂^(r₂) · ... · xₖ^(rₖ)
where the sum runs over all sequences (r₁, r₂, ..., rₖ) with r₁ + r₂ + ... + rₖ = n.
The coefficient n!/(r₁!r₂!...rₖ!) is called a multinomial coefficient and counts how many ways you can arrange n objects where r₁ are of type 1, r₂ are of type 2, and so on—exactly like permutations with repetition!
Example Pattern
For (x + y + z)²:
- All ways to partition 2: (2,0,0), (0,2,0), (0,0,2), (1,1,0), (1,0,1), (0,1,1)
- Expansion: x² + y² + z² + 2xy + 2xz + 2yz
- Each coefficient comes from 2!/(r₁!r₂!r₃!)
Key Takeaway: The Multinomial Theorem extends binomial expansion to k-term sums by using multinomial coefficients to count all distinct arrangements of exponents that sum to n.