Difference between revisions of "2005 AIME II Problems/Problem 11"

m (See Also)
(Problem)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
  
Let <math> \displaystyle m </math> be a positive integer, and let <math> a_0, a_1,\ldots,a_m </math> be a sequence of integers such that <math> \displaystyle 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> \displaystyle m. </math>
+
Let <math>m </math> be a positive integer, and let <math> a_0, a_1,\ldots,a_m </math> be a sequence of integers 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>
  
''Note: Clearly, the stipulation that the sequence is composed of integers is a minor oversight, as the term <math>\displaystyle a_2 </math>, for example, is obviouly not integral.''
+
''Note: Clearly, the stipulation that the sequence is composed of integers is a minor oversight, as the term <math>a_2 </math>, for example, is obviously not integral.''
  
 
== Solution ==
 
== Solution ==

Revision as of 16:21, 16 August 2011

Problem

Let $m$ be a positive integer, and let $a_0, a_1,\ldots,a_m$ be a sequence of integers such that $a_0 = 37, a_1 = 72, a_m = 0,$ and $a_{k+1} = a_{k-1} - \frac 3{a_k}$ for $k = 1,2,\ldots, m-1.$ Find $m.$

Note: Clearly, the stipulation that the sequence is composed of integers is a minor oversight, as the term $a_2$, for example, is obviously not integral.

Solution

For $\displaystyle 0 < k < m$, we have

$\displaystyle a_{k}a_{k+1} = a_{k-1}a_{k} - 3$.

Thus the product $\displaystyle a_{k}a_{k+1}$ is a monovariant: it decreases by 3 each time $\displaystyle k$ increases by 1. Since for $\displaystyle k = 0$ we have $a_{k}a_{k+1} = 37\cdot 72$, so when $k = \frac{37 \cdot 72}{3} = 888$, $\displaystyle a_{k}a_{k+1}$ will be zero for the first time, which implies that $\displaystyle m = 889$, our answer.

See also

2005 AIME II (ProblemsAnswer KeyResources)
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