Difference between revisions of "2005 AIME II Problems/Problem 11"
Ragnarok23 (talk | contribs) m |
m (→Solution 1) |
||
(16 intermediate revisions by 13 users not shown) | |||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | + | ||
− | == | + | Let <math>m </math> be a positive integer, and let <math> a_0, a_1,\ldots,a_m </math> be a sequence of reals such that <math>a_0 = 37, a_1 = 72, a_m = 0, </math> and <math> a_{k+1} = a_{k-1} - \frac 3{a_k} </math> for <math> k = 1,2,\ldots, m-1. </math> Find <math>m. </math> |
− | == See | + | |
− | + | ==Solution 1== | |
+ | |||
+ | For <math>0 < k < m</math>, we have | ||
+ | |||
+ | <center> | ||
+ | <math>a_{k}a_{k+1} = a_{k-1}a_{k} - 3 </math>. | ||
+ | </center> | ||
+ | |||
+ | Thus the product <math>a_{k}a_{k+1}</math> is a [[monovariant]]: it decreases by 3 each time <math>k</math> increases by 1. For <math>k = 0</math> we have <math>a_{k}a_{k+1} = 37\cdot 72</math>, so when <math>k = \frac{37 \cdot 72}{3} = 888</math>, <math>a_{k}a_{k+1}</math> will be zero for the first time, which implies that <math>m = \boxed{889}</math>, our answer. | ||
+ | |||
+ | |||
+ | Note: In order for <math>a_{m} = 0</math> we need <math>a_{m-2}a_{m-1}=3</math> simply by the recursion definition. | ||
+ | |||
+ | ==Solution 2== | ||
+ | |||
+ | Plugging in <math>k = m-1</math> to the given relation, we get <math>0 = a_{m-2} - \frac {3}{a_{m-1}} \implies{a_{m-2}a_{m-1} = 3}</math>. Inspecting the value of <math>a_{k}a_{k+1}</math> for small values of <math>k</math>, we see that <math>a_{k}a_{k+1} = 37\cdot 72 - 3k</math>. Setting the RHS of this equation equal to <math>3</math>, we find that <math>m</math> must be <math> \boxed{889}</math>. | ||
+ | |||
+ | ~ anellipticcurveoverq | ||
+ | |||
+ | ==Video solution== | ||
+ | |||
+ | https://www.youtube.com/watch?v=JfxNr7lv7iQ | ||
+ | |||
+ | == See also == | ||
+ | {{AIME box|year=2005|n=II|num-b=10|num-a=12}} | ||
+ | |||
+ | [[Category:Intermediate Algebra Problems]] | ||
+ | {{MAA Notice}} |
Revision as of 15:08, 7 October 2020
Problem
Let be a positive integer, and let be a sequence of reals such that and for Find
Solution 1
For , we have
.
Thus the product is a monovariant: it decreases by 3 each time increases by 1. For we have , so when , will be zero for the first time, which implies that , our answer.
Note: In order for we need simply by the recursion definition.
Solution 2
Plugging in to the given relation, we get . Inspecting the value of for small values of , we see that . Setting the RHS of this equation equal to , we find that must be .
~ anellipticcurveoverq
Video solution
https://www.youtube.com/watch?v=JfxNr7lv7iQ
See also
2005 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
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.