Difference between revisions of "Mock AIME II 2012 Problems/Problem 15"
Line 2: | Line 2: | ||
Define <math>a_n=\sum_{i=0}^{n}f(i)</math> for <math>n\ge 0</math> and <math>a_n=0</math>. Given that <math>f(x)</math> is a polynomial, and <math>a_1, a_2+1, a_3+8, a_4+27, a_5+64, a_6+125, \cdots</math> is an arithmetic sequence, find the smallest positive integer value of <math>x</math> such that <math>f(x)<-2012</math>. | Define <math>a_n=\sum_{i=0}^{n}f(i)</math> for <math>n\ge 0</math> and <math>a_n=0</math>. Given that <math>f(x)</math> is a polynomial, and <math>a_1, a_2+1, a_3+8, a_4+27, a_5+64, a_6+125, \cdots</math> is an arithmetic sequence, find the smallest positive integer value of <math>x</math> such that <math>f(x)<-2012</math>. | ||
− | ==Solution | + | ==Solution 1== |
'''Lemma:''' <math>f(x)</math> is a quadratic | '''Lemma:''' <math>f(x)</math> is a quadratic | ||
Line 12: | Line 12: | ||
Since <math>f(x)<-2012</math>, we get <math>-3x^2+9x+2012<0</math>, we are going to have this being true for <math>x> \frac{-9\pm \sqrt{9^2-4(-3)(2012)}}{-6}</math>. Since we want <math>x</math> being positive, we use <math>\negative</math> for <math>\pm</math> to give us <math>x>\frac{-9-\sqrt{24225}}{-6}</math>. The RHS is the same as <math>\frac{9+\sqrt{24225}}{6}</math>. Our goal now is to find <math>\sqrt{24225}</math> approximately. Note that <math>155^2=\underline{15*16},2,5=24025</math> (where <math>15*16, 2</math>, and <math>5</math> are digits of <math>155^2</math>), therefore <math>156>\sqrt{24225}>155</math>, and substitute this into our equation for <math>x</math> to give a smallest possible value of <math>x</math> being <math>\frac{156+9}{6}>x>\frac{155+9}{6}</math> to give us <math>27.5>x>27.\overline{3}</math> and hence the smallest possible positive integer value for <math>x</math> is <math>\boxed{028}</math>. | Since <math>f(x)<-2012</math>, we get <math>-3x^2+9x+2012<0</math>, we are going to have this being true for <math>x> \frac{-9\pm \sqrt{9^2-4(-3)(2012)}}{-6}</math>. Since we want <math>x</math> being positive, we use <math>\negative</math> for <math>\pm</math> to give us <math>x>\frac{-9-\sqrt{24225}}{-6}</math>. The RHS is the same as <math>\frac{9+\sqrt{24225}}{6}</math>. Our goal now is to find <math>\sqrt{24225}</math> approximately. Note that <math>155^2=\underline{15*16},2,5=24025</math> (where <math>15*16, 2</math>, and <math>5</math> are digits of <math>155^2</math>), therefore <math>156>\sqrt{24225}>155</math>, and substitute this into our equation for <math>x</math> to give a smallest possible value of <math>x</math> being <math>\frac{156+9}{6}>x>\frac{155+9}{6}</math> to give us <math>27.5>x>27.\overline{3}</math> and hence the smallest possible positive integer value for <math>x</math> is <math>\boxed{028}</math>. | ||
+ | |||
+ | ==Solution 2== | ||
+ | Another way of finding <math>f(x)</math> is noticing that <math>a_n-a_{n-1}=\sum_{i=0}^{n}f(i)-\sum_{i=0}^{n-1}f(i)= f(n)</math> and that the terms of the arithmetic sequence are <math>a_n+(n-1)^2</math>. The difference of arithmetic sequences are constant, so <math>a_n+(n-1)^2-(a_{n-1}+(n-2)^2)= f(n) + 3n^2 - 9n + 7</math> is constant. Let that constant be <math>c</math>. Then <math>f(n)+3n^2-9n+7 =c</math> and so <math>f(n) = -3n^2+9n +7+c</math>. The solution follows as above. |
Revision as of 15:37, 27 December 2012
Problem:
Define for and . Given that is a polynomial, and is an arithmetic sequence, find the smallest positive integer value of such that .
Solution 1
Lemma: is a quadratic
Proof: Note that using the method of finite differences, once we get to a constant term, the rest of the terms in the polynomial that have not been eliminated are going to be .
Since is an arithmetic sequence, difference(let this be h), we get in general . Therefore . We now have equations with our polynomials. Subtract all consecutive equations to give us , , . Let . Note that subtracting two equations eliminates , and we are going to be taking two more differences to get the equations equal to . These two more differences subtract the term and the term, because by method of finite differences, you only have to take and differences respectively to eliminate the linear/quadratic term. Therefore is quadratic.
Now, let . Since , we have or . Since , we get and . Subtract the LHS from the RHS of the equations to give us and . Subtract these two equations to give us or . Now, substitute this into to give us or . Therefore .
Since , we get , we are going to have this being true for . Since we want being positive, we use $\negative$ (Error compiling LaTeX. Unknown error_msg) for to give us . The RHS is the same as . Our goal now is to find approximately. Note that (where , and are digits of ), therefore , and substitute this into our equation for to give a smallest possible value of being to give us and hence the smallest possible positive integer value for is .
Solution 2
Another way of finding is noticing that and that the terms of the arithmetic sequence are . The difference of arithmetic sequences are constant, so is constant. Let that constant be . Then and so . The solution follows as above.