AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!

Multinomial Theorem

From AoPSWiki

Revision as of 15:50, 30 April 2008 by JBL (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

The Multinomial Theorem states that (a_1+a_2+\cdots+a_k)^n=\sum_{\substack{j_1,j_2,\ldots,j_k \\ 0 \leq j_i \leq n \textrm{ for each } i \\\textrm{and } j_1 + \l... where \binom{n}{j_1; j_2; \ldots ; j_k} is the multinomial coefficient \binom{n}{j_1; j_2; \ldots ; j_k}=\dfrac{n!}{j_1!\cdot j_2!\cdots j_k!}.

Note that this is a direct generalization of the Binomial Theorem: when k = 2 it simplifies to (a_1 + a_2)^n = \sum_{\substack{0\leq j_1, j_2 \leq n \\ j_1 + j_2 = n}} \binom{n}{j_1; j_2} a_1^{j_1}a_2^{j_2} = \sum_{j = 0...

Contents

Proof

Using induction and the Binomial Theorem

This section is incomplete. You can help us out by completing it.

Combinatorial proof

This section is incomplete. You can help us out by completing it.

Problems

Introductory

This problem has not been edited in. If you know this problem, please help us out by adding it.

Intermediate

(x+y+z)^{2006}+(x-y-z)^{2006}

is simplified by expanding it and combining like terms. How many terms are in the simplified expression?

\mathrm{(A) \ } 6018\qquad \mathrm{(B) \ } 671,676\qquad \mathrm{(C) \ } 1,007,514\qquad \mathrm{(D) \ } 1,008,016\qquad\math...

(Source: 2006 AMC 12A Problem 24)

Olympiad

This problem has not been edited in. If you know this problem, please help us out by adding it.

This article is a stub. Help us out by expanding it.

Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us