Multinomial Coefficients and Word Arrangements
You'll learn how to count the distinct arrangements of letters in words where some letters repeat, using multinomial coefficients.
The Core Idea
When you want to arrange letters in a word like "MISSISSIPPI," you can't just use permutations directly because identical letters create duplicate arrangements. The multinomial coefficient tells you exactly how many distinct arrangements exist.
The formula is:
Number of distinct arrangements = n! / (n₁! × n₂! × ... × nₖ!)
where:
n= total number of lettersn₁, n₂, ..., nₖ= frequencies of each distinct letter
Why This Works
Think of it like this: if all letters were unique, you'd have n! arrangements. But when some letters are identical, many of these arrangements look the same. You're "overcounting" by a factor equal to the number of ways to rearrange each group of identical letters among themselves.
For example, MISSISSIPPI has:
- Total: 11 letters
- M: 1, I: 4, S: 4, P: 2
Distinct arrangements = 11! / (1! × 4! × 4! × 2!) = 34,650
The 4! in the denominator for I's divides out all the ways to swap the four I's with each other (which don't create new words). Same logic for the S's and P's.
Connecting to Multinomial Coefficients
This is exactly the multinomial coefficient from the multinomial theorem! We're distributing 11 positions among 4 types of letters: M gets 1 position, I gets 4, S gets 4, P gets 2.
Key Takeaway: To count distinct arrangements of objects with repetition, divide the total factorial by the product of factorials of each group's size—this is the multinomial coefficient in action.