Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2005 AIME II Problems/Problem 11"
 
(7 intermediate revisions by 5 users not shown)
Line 12: Line 12:
  
 
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.
 
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==
 
==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>.
+
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
 
~ anellipticcurveoverq
 +
 +
==Induction Proof==
 +
As above, we experiment with some values of <math>a_{k}a_{k+1}</math>, conjecturing that <math>a_{m-p}a_{m-p-1}</math> = <math>3p</math> ,where <math>m</math> is a positive integer and so is <math>p</math>, and we prove this formally using induction. The base case is for <math>p = 1</math>, <math>a_{m} = a_{m-2} - 3/a_{m-1}</math> Since <math>a_{m} = 0 </math>, <math>a_{m-1}a_{m-2} = 3</math>; from the recursion given in the problem <math>a_{m-p+1} = a_{m-p-1} - 3/a_{m-p}</math>, so <math>a_{m-p+1} = 3p/a_{m-p} - 3/a_{m-p} = 3(p-1)/a_{m-p}</math>, so <math>a_{m-p}a_{m-p+1} = a_{m-(p-1)}a_{m-(p-1)-1} = 3(p-1)</math>, hence proving our formula by induction.
 +
~USAMO2023
 +
 +
==Solution 3 (Telescoping)==
 +
Note that <math> a_{k+1}\cdot a_{k} - a_{k}\cdot a_{k-1} = - 3 </math>. Then, we can generate a sum of series of equations such that <math>\sum_{k=1}^{m-1} a_{k+1}\cdot a_{k} - a_{k}\cdot a_{k-1} = - 3(m-1)</math>. Then, note that all but the first and last terms on the LHS cancel out, leaving us with <math>a_m\cdot a_{m-1} - a_1\cdot a_0 = -3(m-1)</math>. Plugging in <math>a_m=0</math>, <math>a_0=37</math>, <math>a_1=72</math>, we have <math>-37\cdot 72 = -3(m-1)</math>. Solving for <math>m</math> gives <math>m=\boxed{889}</math>.
 +
~sigma
 +
 +
 +
==Video solution==
 +
 +
https://www.youtube.com/watch?v=JfxNr7lv7iQ
  
 
== See also ==
 
== See also ==

Latest revision as of 17:52, 21 November 2022

Problem

Let $m$ be a positive integer, and let $a_0, a_1,\ldots,a_m$ be a sequence of reals 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.$

Solution 1

For $0 < k < m$, we have

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

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


Note: In order for $a_{m} = 0$ we need $a_{m-2}a_{m-1}=3$ simply by the recursion definition.

Solution 2

Plugging in $k = m-1$ to the given relation, we get $0 = a_{m-2} - \frac {3}{a_{m-1}} \implies{a_{m-2}a_{m-1} = 3}$. Inspecting the value of $a_{k}a_{k+1}$ for small values of $k$, we see that $a_{k}a_{k+1} = 37\cdot 72 - 3k$. Setting the RHS of this equation equal to $3$, we find that $m$ must be $\boxed{889}$.

~ anellipticcurveoverq

Induction Proof

As above, we experiment with some values of $a_{k}a_{k+1}$, conjecturing that $a_{m-p}a_{m-p-1}$ = $3p$ ,where $m$ is a positive integer and so is $p$, and we prove this formally using induction. The base case is for $p = 1$, $a_{m} = a_{m-2} - 3/a_{m-1}$ Since $a_{m} = 0$, $a_{m-1}a_{m-2} = 3$; from the recursion given in the problem $a_{m-p+1} = a_{m-p-1} - 3/a_{m-p}$, so $a_{m-p+1} = 3p/a_{m-p} - 3/a_{m-p} = 3(p-1)/a_{m-p}$, so $a_{m-p}a_{m-p+1} = a_{m-(p-1)}a_{m-(p-1)-1} = 3(p-1)$, hence proving our formula by induction. ~USAMO2023

Solution 3 (Telescoping)

Note that $a_{k+1}\cdot a_{k} - a_{k}\cdot a_{k-1} = - 3$. Then, we can generate a sum of series of equations such that $\sum_{k=1}^{m-1} a_{k+1}\cdot a_{k} - a_{k}\cdot a_{k-1} = - 3(m-1)$. Then, note that all but the first and last terms on the LHS cancel out, leaving us with $a_m\cdot a_{m-1} - a_1\cdot a_0 = -3(m-1)$. Plugging in $a_m=0$, $a_0=37$, $a_1=72$, we have $-37\cdot 72 = -3(m-1)$. Solving for $m$ gives $m=\boxed{889}$. ~sigma


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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2005_AIME_II_Problems/Problem_11&oldid=182754"