Difference between revisions of "2006 AMC 12A Problems/Problem 24"
Pkerichang (talk | contribs) (→Solution) |
Pkerichang (talk | contribs) (→Solution) |
||
Line 32: | Line 32: | ||
if the exponent of <math>y</math> is 2005, then <math>z</math> can only be 0. So 1 term. | if the exponent of <math>y</math> is 2005, then <math>z</math> can only be 0. So 1 term. | ||
− | add them up we get <math>\frac{1003\cdot1004}{2}</math> terms. However, we can switch the exponents of <math>y</math> and <math>z</math> and these terms will still have a negative sign. So there are a total of <math>1003 | + | add them up we get <math>\frac{1003\cdot1004}{2}</math> terms. However, we can switch the exponents of <math>y</math> and <math>z</math> and these terms will still have a negative sign. So there are a total of <math>1003\cdot1004</math> negative terms. |
Subtract this number from 2015028 we obtain <math>D. 1008016</math> as our answer. | Subtract this number from 2015028 we obtain <math>D. 1008016</math> as our answer. |
Revision as of 18:03, 15 July 2006
Problem
The expression
is simplified by expanding it and combining like terms. How many terms are in the simplified expression?
Solution
by the Multinomial Theorem, the expressions of the two are:
and:
respectively, where . 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:
terms without cancellation. For any term in the second expansion to be negative, the parity of the exponents of and must be opposite. Now we find a pattern:
if the exponent of is 1, the exponent of can be all even integers up to 2004, so 1003 terms.
if the exponent of is 3, the exponent of can go up to 2002, so 1002 terms.
if the exponent of is 2005, then can only be 0. So 1 term.
add them up we get terms. However, we can switch the exponents of and and these terms will still have a negative sign. So there are a total of negative terms.
Subtract this number from 2015028 we obtain as our answer.