Added to Favorites

Related Searches

Definitions

Nearby Words

In mathematics, the multinomial theorem says how to write a power of a sum in terms of powers of the terms in that sum. It is the generalization of the binomial theorem to polynomials.
## Theorem

For any positive integer m and any nonnegative integer n, the multinomial formula tells us how a polynomial expands when raised to an arbitrary power:### The multinomial coefficients

### Example

## Interpretations

### Ways to put objects into sized boxes

The multinomial coefficients have a direct combinatorial interpretation, as the number of ways of depositing n distinct objects in m bins, with k_{1} objects in the first bin, k_{2} objects in the second bin, and so on.
### Number of unique permutations of words

In addition, the multinomial coefficient is also the number of distinct ways to permute a multiset of n elements, and k_{i} are the multiplicities of each of the distinct elements. For example, the number of distinct permutations of the letters of the word MISSISSIPPI, which has 1 M, 4 I's, 4 S's, and 2 P's is
### Generalized Pascal's triangle

## Proof

This proof of the multinomial theorem uses the binomial theorem and induction on m. ## See also

- $(x\_1\; +\; x\_2\; +\; cdots\; +\; x\_m)^n$

The summation is taken over all sequences of nonnegative integer indices k_{1} through k_{m} such that $sum\_\{i=1\}^m\; \{k\_i\}\; =\; n$ (for each term in the expansion, the exponents must add up to n). (As with the binomial theorem, quantities of the form 0^{0} which appear are taken to equal 1.)

The numbers

- $\{n\; choose\; k\_1,\; k\_2,\; ldots,\; k\_m\}$

(which can also be written as:)

- $$

are the multinomial coefficients. Just like "n choose k" are the coefficients when you raise a binomial to the nth power (e.g. $coefficients=\{1,3,3,1\}$ for $(a+b)^3$, where $n=3$), the multinomial coefficients appear when one raises a multinomial to the nth power (e.g. $(a+b+c)^3$)

- $(a+b+c)^3$

- $=\; a^3\; +\; b^3\; +\; c^3\; +\; 3\; a^2\; b\; +\; 3\; a^2\; c\; +\; 3\; b^2\; a\; +\; 3\; b^2\; c\; +\; 3\; c^2\; a\; +\; 3\; c^2\; b\; +\; 6\; a\; b\; c$

We could have calculated each coefficient by first expanding $(a+b+c)^2=a^2+b^2+c^2+2\; a\; b+2\; b\; c+2\; a\; c$, then self-multiplying it again to get $(a+b+c)^3$ (and then if we were raising it to higher powers, we'd multiply it by itself even some more). However this process is slow, and can be avoided by using the multinomial theorem. The multinomial theorem "solves" this process by giving us the closed form for any coefficient we might want. It is possible to "read off" the multinomial coefficients from the terms by using the multinomial coefficient formula. For example:

- $a^2\; b^0\; c^1\; =>\; \{3\; choose\; 2,\; 0,\; 1\}\; =\; frac\{3!\}\{2!\; 0!\; 1!\}\; =\; frac\{6\}\{2*1*1\}\; =\; 3$

- $a^1\; b^1\; c^1\; =>\; \{3\; choose\; 1,\; 1,\; 1\}\; =\; frac\{3!\}\{1!\; 1!\; 1!\}\; =\; frac\{6\}\{1*1*1\}\; =\; 6$

We could have also had a 'd' variable, or even more variables -- hence the multinomial theorem.

- $\{11\; choose\; 1,\; 4,\; 4,\; 2\}\; =\; frac\{11!\}\{1!,\; 4!,\; 4!,\; 2!\}\; =\; 34650$

The binomial theorem and binomial coefficients are special cases, for m = 2, of the multinomial theorem and multinomial coefficients, respectively.

(This is just like saying that there are 11! ways to permute the letters -- the common interpretation of factorial as the number of unique permutations. However, we counted extra due to the fact that some letters are the same, and must divide to correct our answer.)

One can use the multinomial theorem to generalize Pascal's triangle to Pascal's pyramid or Pascal's Simplex. This provides a quick way to generate a lookup table for multinomial coefficients.

The case of n=3 can be easily drawn by hand. The case of n=4 can be drawn with effort as a series of growing pyramids.

First, for m = 1, both sides equal $x\_1^n$. For the induction step, suppose the multinomial theorem holds for m. Then

- $(x\_1+x\_2+cdots+x\_m+x\_\{m+1\})^n\; =\; (x\_1+x\_2+cdots+(x\_m+x\_\{m+1\}))^n$

- $=\; sum\_\{k\_1+k\_2+cdots+k\_\{m-1\}+K=n\}\{nchoose\; k\_1,k\_2,ldots,k\_\{m-1\},K\}\; x\_1^\{k\_1\}x\_2^\{k\_2\}cdots\; x\_\{m-1\}^\{k\_\{m-1\}\}(x\_m+x\_\{m+1\})^K$

- $=\; sum\_\{k\_1+k\_2+cdots+k\_\{m-1\}+K=n\}\{nchoose\; k\_1,k\_2,ldots,k\_\{m-1\},K\}\; x\_1^\{k\_1\}x\_2^\{k\_2\}cdots\; x\_\{m-1\}^\{k\_\{m-1\}\}sum\_\{k\_m+k\_\{m+1\}=K\}\{Kchoose\; k\_m,k\_\{m+1\}\}x\_m^\{k\_m\}x\_\{m+1\}^\{k\_\{m+1\}\}$

- $=\; sum\_\{k\_1+k\_2+cdots+k\_\{m-1\}+k\_m+k\_\{m+1\}=n\}\{nchoose\; k\_1,k\_2,ldots,k\_\{m-1\},k\_m,k\_\{m+1\}\}\; x\_1^\{k\_1\}x\_2^\{k\_2\}cdots\; x\_\{m-1\}^\{k\_\{m-1\}\}x\_m^\{k\_m\}x\_\{m+1\}^\{k\_\{m+1\}\}$

- $\{nchoose\; k\_1,k\_2,ldots,k\_\{m-1\},K\}\{Kchoose\; k\_m,k\_\{m+1\}\}\; =\; \{nchoose\; k\_1,k\_2,ldots,k\_\{m-1\},k\_m,k\_\{m+1\}\},$

- $frac\{n!\}\{k\_1!\; k\_2!\; cdots\; k\_\{m-1\}!K!\}\; frac\{K!\}\{k\_m!\; k\_\{m+1\}!\}=frac\{n!\}\{k\_1!\; k\_2!\; cdots\; k\_\{m+1\}!\}$

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Saturday October 11, 2008 at 11:19:29 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Saturday October 11, 2008 at 11:19:29 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.