The Multinomial Theorem and Multinomial Coefficients

College Depth 68 in the knowledge graph I know this Set as goal
combinatorics multinomial

Core Idea

The multinomial theorem generalizes the binomial theorem to (x₁ + x₂ + ⋯ + xₖ)^n. Multinomial coefficients n!/(n₁!n₂!⋯nₖ!) count the ways to partition n items into k labeled groups of specified sizes.

Explainer

You already know the binomial theorem: (x + y)^n = Σ C(n,k) xᵏ yⁿ⁻ᵏ, where C(n,k) = n!/(k!(n−k)!). The coefficient C(n,k) counts the number of ways to choose k of the n factors to contribute an x, while the remaining n−k factors contribute a y. The multinomial theorem is the same idea with more than two choices.

When you expand (x + y + z)^3, you are choosing — for each of the 3 factors — whether to pick x, y, or z. A term like x²yz¹ arises when exactly 2 factors contribute x, 1 contributes y, and 0 contribute z — wait, let's say the exponents are n₁ = 2, n₂ = 0, n₃ = 1 to be precise. The multinomial coefficient n!/(n₁!n₂!...nₖ!) counts the number of ways to assign roles to the n factors: it equals the number of ways to arrange n objects where n₁ are of type 1, n₂ of type 2, and so on. This is the same formula you use to count anagrams: the word MISSISSIPPI has 11 letters with 1 M, 4 I's, 4 S's, and 2 P's, so there are 11!/(1!4!4!2!) = 34,650 distinct arrangements.

The full multinomial theorem states: (x₁ + x₂ + ⋯ + xₖ)^n = Σ [n!/(n₁!n₂!⋯nₖ!)] x₁^n₁ x₂^n₂ ⋯ xₖ^nₖ, where the sum runs over all tuples (n₁, n₂, ..., nₖ) of non-negative integers with n₁ + n₂ + ⋯ + nₖ = n. This is a direct extension of the binomial case with k = 2. As a check: setting x₁ = x₂ = ⋯ = xₖ = 1, the left side becomes kⁿ and the right side sums all multinomial coefficients — this gives a useful identity.

Multinomial coefficients appear throughout combinatorics wherever you distribute n objects into labeled categories. They generalize the binomial coefficient's "n choose k" to "n divided into k groups of sizes n₁, n₂, ..., nₖ." Notice that C(n, k) is a special case: n!/(k!(n−k)!) is exactly the multinomial coefficient for k = 2 with group sizes k and n−k. When you proceed to the inclusion-exclusion principle, multinomial coefficients will appear again — the principle repeatedly counts and subtracts arrangements of items distributed across overlapping sets, which is precisely what multinomial coefficients measure.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineOpposites and Additive InversesAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesLiteral EquationsSlope-Intercept FormPoint-Slope FormWriting Linear EquationsParallel and Perpendicular Line SlopesGraphing Linear EquationsPiecewise FunctionsStep FunctionsComposition of FunctionsInverse FunctionsRadical Functions and GraphsRational ExponentsExponential Functions and GraphsGeometric Sequences and SeriesSigma NotationExpected ValueThe Probabilistic Method in Graph TheoryProbabilistic Method in CombinatoricsPermutations and Ordered ArrangementsCombinations and Unordered SelectionsBinomial Coefficients and Pascal's TriangleThe Multinomial Theorem and Multinomial Coefficients

Longest path: 69 steps · 303 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.