2006 AMC 12A Problems/Problem 24


The expression


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\mathrm{(E) \ }  2,015,028$

Solution 1

By the Multinomial Theorem, the summands can be written as




respectively. Since the coefficients of like terms are the same in each expression, each like term either cancel one another out or the coefficient doubles. In each expansion there are:

\[{2006+2\choose 2} = 2015028\]

terms without cancellation. For any term in the second expansion to be negative, the parity of the exponents of $y$ and $z$ must be opposite. Now we find a pattern:

if the exponent of $y$ is $1$, the exponent of $z$ can be all even integers up to $2004$, so there are $1003$ terms.

if the exponent of $y$ is $3$, the exponent of $z$ can go up to $2002$, so there are $1002$ terms.


if the exponent of $y$ is $2005$, then $z$ can only be 0, so there is $1$ term.

If we add them up, we get $\frac{1003\cdot1004}{2}$ terms. However, we can switch the exponents of $y$ and $z$ and these terms will still have a negative sign. So there are a total of $1003\cdot1004$ negative terms.

By subtracting this number from 2015028, we obtain $\boxed{\mathrm{D}}$ or $1,008,016$ as our answer.

Solution 2

Alternatively, we can use a generating function to solve this problem. The goal is to find the generating function for the number of unique terms in the simplified expression (in terms of $k$). In other words, we want to find $f(x)$ where the coefficient of $x^k$ equals the number of unique terms in $(x+y+z)^k + (x-y-z)^k$.

First, we note that all unique terms in the expression have the form, $Cx^ay^bz^c$, where $a+b+c=k$ and $C$ is some constant. Therefore, the generating function for the MAXIMUM number of unique terms possible in the simplified expression of $(x+y+z)^k + (x-y-z)^k$ is \[(1+x+x^2+x^3\cdots)^3 = \frac{1}{(1-x)^3}\]

Secondly, we note that a certain number of terms of the form, $Cx^ay^bz^c$, do not appear in the simplified version of our expression because those terms cancel. Specifically, we observe that terms cancel when $1 \equiv b+c\text{ (mod }2\text{)}$ because every unique term is of the form: \[\binom{k}{a,b,c}x^ay^bz^c+(-1)^{b+c}\binom{k}{a,b,c}x^ay^bz^c\] for all possible $a,b,c$.

Since the generating function for the maximum number of unique terms is already known, it is logical that we want to find the generating function for the number of terms that cancel, also in terms of $k$. With some thought, we see that this desired generating function is the following: \[2(x+x^3+x^5\cdots)(1+x^2+x^4\cdots)(1+x+x^2+x^3\cdots) = \frac{2x}{(1-x)^3(1+x)^2}\]

Now, we want to subtract the latter from the former in order to get the generating function for the number of unique terms in $(x+y+z)^k + (x-y-z)^k$, our initial goal: \[\frac{1}{(1-x)^3}-\frac{2x}{(1-x)^3(1+x)^2} = \frac{x^2+1}{(1-x)^3(1+x)^2}\] which equals \[(x^2+1)(1+x+x^2\cdots)^3(1-x+x^2-x^3\cdots)^2\]

The coefficient of $x^{2006}$ of the above expression equals \[\sum_{a=0}^{2006}\binom{2+a}{2}\binom{1+2006-a}{1}(-1)^a + \sum_{a=0}^{2004}\binom{2+a}{2}\binom{1+2004-a}{1}(-1)^a\]

Evaluating the expression, we get $1008016$, as expected.

Solution 3

Define $P$ such that $P=y+z$. Then the expression in the problem becomes: $(x+P)^{2006}+(x-P)^{2006}$.

Expanding this using binomial theorem gives $(x^n+Px^{n-1}+...+P^{n-1}x+P^n)+(x^n-Px^{n-1}+...-P^{n-1}x+P^n)$, where $n=2006$ (we may omit the coefficients, as we are seeking for the number of terms, not the terms themselves).

Simplifying gives: $2(x^n+x^{n-2}P^2+...+x^2P^{n-2}+P^n)$. Note that two terms that come out of different powers of $P$ cannot combine and simplify, as their exponent of $x$ will differ. Therefore, we simply add the number of terms produced from each addend. By the Binomial Theorem, $P^k=(y+z)^k$ will have $k+1$ terms, so the answer is $1+3+5+...+2007=1004^2=1,008,016 \implies \boxed{D}$.

Solution 4

Using stars and bars we know that $(x+y+z)^{2006}$ has ${2006+2\choose 2}$ or $2015028$ different terms. Now we need to find out how many of these terms are canceled out by $(x-y-z)^{2006}$. We know that for any term(let's say $x^{a}(-y)^{b}(-z)^{c}$) where $a+b+c=2006$ of the expansion of $(x-y-z)^{2006}$ is only going to cancel out with the corresponding term $x^{a}y^{b}z^{c}$ if only $b$ is odd and $c$ is even or $b$ is even and $c$ is odd. Now let's do some casework to see how many terms fit this criteria:

Case 1: $a$ is even

Now we know that $a$ is even and $a+b+c=2006$. Thus $b+c$ is also even or both $b$ and $c$ are odd or both $b$ and $c$ are even. This case clearly fails the above criteria and there are 0 possible solutions.

Case 2: $a$ is odd

Now we know that $a$ is odd and $a+b+c=2006$. Thus $b+c$ is odd and $b$ is odd and $c$ is even or $b$ is even and $c$ is odd. All terms that have $a$ being odd work.

We now need to figure out how many of the terms have $a$ as a odd number. We know that $a$ can be equal to any number between 0 and 2006. There are 1003 odd numbers between this range and 2007 total numbers. Thus $\frac{1003}{2007}$ of the $2015028$ terms will cancel out and $\frac{1004}{2007}$ of the terms will work. Thus there are $(\frac{1004}{2007})(2015028)$ terms. This number comes out to be $1,008,016$ $\implies \boxed{D}$ (Author: David Camacho)

Solution 5

Noticing how $y$ and $z$ are negative in the second part of the expression, let $x=a$ and $y+z = b$. Then we get \[(a+b)^{2006} + (a-b)^{2006}\] We know that the terms that don't cancel out have even powers of $a$ and $b$. Our expansion will be in the form of \[2a^{2006} + x_1a^{2004}b^{2} + x_2a^{2002}b^{4} + \cdots + 2b^{2006}\] Note that $b^n = (x+y)^n$ has $n+1$ terms. Furthermore, the current expression is irreducible as each term has a different $x$ power. Thus, when we write $a$ and $b$ back to their original terms, we will have $1+3+5+ \cdots + 2007 = 1004^2 = 1,008,016 \implies \boxed{D}$


See also

2006 AMC 12A (ProblemsAnswer KeyResources)
Preceded by
Problem 23
Followed by
Problem 25
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png