Difference between revisions of "1993 AIME Problems/Problem 5"
m (→Solution 2) |
m (Fixed solution number from 3 to 2) |
||
Line 15: | Line 15: | ||
Adding up the coefficients, we get <math>630 \cdot 210 - 626 \cdot 210 - 77 = \boxed{763}</math>. | Adding up the coefficients, we get <math>630 \cdot 210 - 626 \cdot 210 - 77 = \boxed{763}</math>. | ||
− | == Solution | + | == Solution 2 (Overkill) == |
Denote the coefficient of term <math>x^m</math> of polynomial <math>P_n(x)</math> as <math>c_{m, n}</math>. We can see that <math>c_{2, 0} = 313</math>, <math>c_{1, 0} = -77</math>, and <math>c_{0, 0} = -8</math>. Note that <math>(x-n)^3 = x^3-3nx^2+3n^2x-n^3</math> and <math>(x-n)^2 = x^2-2nx+n^2</math> | Denote the coefficient of term <math>x^m</math> of polynomial <math>P_n(x)</math> as <math>c_{m, n}</math>. We can see that <math>c_{2, 0} = 313</math>, <math>c_{1, 0} = -77</math>, and <math>c_{0, 0} = -8</math>. Note that <math>(x-n)^3 = x^3-3nx^2+3n^2x-n^3</math> and <math>(x-n)^2 = x^2-2nx+n^2</math> | ||
When substituting <math>x-1</math> for <math>x</math> in <math>P_0(x)</math>, we get that <math>P_1(x) = P_0(x-1) = (x^3-3x^2+3x-1) + 313(x^2-2x+1) -77(x-1) -8</math>. Observe that | When substituting <math>x-1</math> for <math>x</math> in <math>P_0(x)</math>, we get that <math>P_1(x) = P_0(x-1) = (x^3-3x^2+3x-1) + 313(x^2-2x+1) -77(x-1) -8</math>. Observe that |
Latest revision as of 23:28, 9 June 2025
Problem
Let . For integers
, define
. What is the coefficient of
in
?
Solution 1
Notice that
Using the formula for the sum of the first numbers,
. Therefore,
Substituting into the function definition, we get
. We only need the coefficients of the linear terms, which we can find by the binomial theorem.
will have a linear term of
.
will have a linear term of
.
will have a linear term of
.
Adding up the coefficients, we get .
Solution 2 (Overkill)
Denote the coefficient of term of polynomial
as
. We can see that
,
, and
. Note that
and
When substituting
for
in
, we get that
. Observe that
It is evident that
Define the generating function
as
By multiplying both sides of the previous recurrence relation and taking the sum of the terms
, we get that
We can perform a similar analysis on
to get the recurrence relation
Define the generating function
as
We can then perform this process again on our new recurrence relation:
Finally, we can plug
into our new explicit formula to get
This can be calculated by differentiating the generating function of the sequence 1, 1, 1, ...
and multiplying by
.
This form can be found by applying Newton's generalized binomial theorem.
This formula can be found by convolving the polynomial with the series.
- MathCactus0_0 (don't try this on a test unless you can't think of anything else!!!)
See also
1993 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.