Difference between revisions of "1993 AIME Problems/Problem 5"
(→Solution 3 (Overkill)) |
(→Solution 3 (Overkill)) |
||
Line 38: | Line 38: | ||
<cmath>c_{1,n} = c_{1, n-1} + c_{2,n-1}\cdot(-2n) + 3n^2</cmath> | <cmath>c_{1,n} = c_{1, n-1} + c_{2,n-1}\cdot(-2n) + 3n^2</cmath> | ||
<cmath>= c_{1, n-1} +3n^3 - 626n</cmath> | <cmath>= c_{1, n-1} +3n^3 - 626n</cmath> | ||
− | |||
Define the generating function <math>C_1(X)</math> as | Define the generating function <math>C_1(X)</math> as | ||
<cmath>C_1(X) := \sum_{n\geq0}c_{1,n}X^n</cmath> | <cmath>C_1(X) := \sum_{n\geq0}c_{1,n}X^n</cmath> |
Revision as of 06:29, 16 September 2024
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
Notice the transformation of adds to the roots. Thus, all these transformations will take the roots and add to them. (Indeed, this is very easy to check in general.)
Let the roots be Then By Vieta's/expanding/common sense, you see the coefficient of is Expanding yields Using Vieta's (again) and plugging stuff in yields
Solution 3 (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 {\footnotesize *This can be calculated by differentiating the generating function of the sequence 1, 1, 1, ... and multiplying by . \newline This form can be found by applying Newton's generalized binomial theorem. \newline This formula can be found by convolving the polynomial with the series.}
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.