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 "2008 AIME II Problems/Problem 6"

(→‎Solution)
 
(One intermediate revision by one other user not shown)
Line 14: Line 14:
 
from which it follows that <math>\frac{a_n}{a_{n-1}} = 1+ \frac{a_{n-1}}{a_{n-2}} = \cdots = (n-1) + \frac{a_{1}}{a_0} = n</math> and <math>\frac{b_n}{b_{n-1}} = (n-1) + \frac{b_{1}}{b_0} = n+2</math>. These [[recursion]]s, <math>a_{n} = na_{n-1}</math> and <math>b_{n} = (n+2)b_{n-1}</math>, respectively, correspond to the explicit functions <math>a_n = n!</math> and <math>b_n = \frac{(n+2)!}{2}</math> (after applying our initial conditions). It follows that <math>\frac{b_{32}}{a_{32}} = \frac{\frac{34!}{2}}{32!} = \frac{34 \cdot 33}{2} = \boxed{561}</math>.
 
from which it follows that <math>\frac{a_n}{a_{n-1}} = 1+ \frac{a_{n-1}}{a_{n-2}} = \cdots = (n-1) + \frac{a_{1}}{a_0} = n</math> and <math>\frac{b_n}{b_{n-1}} = (n-1) + \frac{b_{1}}{b_0} = n+2</math>. These [[recursion]]s, <math>a_{n} = na_{n-1}</math> and <math>b_{n} = (n+2)b_{n-1}</math>, respectively, correspond to the explicit functions <math>a_n = n!</math> and <math>b_n = \frac{(n+2)!}{2}</math> (after applying our initial conditions). It follows that <math>\frac{b_{32}}{a_{32}} = \frac{\frac{34!}{2}}{32!} = \frac{34 \cdot 33}{2} = \boxed{561}</math>.
  
−
== Solution 2 ==
+
From this, we can determine that the sequence <math>\frac {b_n}{a_n}</math> corresponds to the [[triangular number]]s.
−
It's very easy just to write out the first couple terms of each and find a pattern. The terms of <math>{a_n}</math> are 1,1,2,6,and 24. The terms of <math>{b_n}</math> are 1,3,12,60,and 360. When we divide <math>{b_n}</math> by <math>{a_n}</math>, we get 1,3,6,10, and 15, the triangular numbers! But since 1 corresponds to <math>{a_0}/{b_0}</math>, the answer is the 33rd triangular number, which is 561.
 
  
 
== See also ==
 
== See also ==
Line 21: Line 20:
  
 
[[Category:Intermediate Algebra Problems]]
 
[[Category:Intermediate Algebra Problems]]
 +
{{MAA Notice}}

Latest revision as of 22:34, 4 July 2013

Problem

The sequence $\{a_n\}$ is defined by \[a_0 = 1,a_1 = 1, \text{ and } a_n = a_{n - 1} + \frac {a_{n - 1}^2}{a_{n - 2}}\text{ for }n\ge2.\] The sequence $\{b_n\}$ is defined by \[b_0 = 1,b_1 = 3, \text{ and } b_n = b_{n - 1} + \frac {b_{n - 1}^2}{b_{n - 2}}\text{ for }n\ge2.\] Find $\frac {b_{32}}{a_{32}}$.

Solution

Rearranging the definitions, we have \[\frac{a_n}{a_{n-1}} = \frac{a_{n-1}}{a_{n-2}} + 1,\quad \frac{b_n}{b_{n-1}} = \frac{b_{n-1}}{b_{n-2}} + 1\] from which it follows that $\frac{a_n}{a_{n-1}} = 1+ \frac{a_{n-1}}{a_{n-2}} = \cdots = (n-1) + \frac{a_{1}}{a_0} = n$ and $\frac{b_n}{b_{n-1}} = (n-1) + \frac{b_{1}}{b_0} = n+2$. These recursions, $a_{n} = na_{n-1}$ and $b_{n} = (n+2)b_{n-1}$, respectively, correspond to the explicit functions $a_n = n!$ and $b_n = \frac{(n+2)!}{2}$ (after applying our initial conditions). It follows that $\frac{b_{32}}{a_{32}} = \frac{\frac{34!}{2}}{32!} = \frac{34 \cdot 33}{2} = \boxed{561}$.

From this, we can determine that the sequence $\frac {b_n}{a_n}$ corresponds to the triangular numbers.

See also

2008 AIME II (Problems • Answer Key • Resources)
Preceded by
Problem 5 		Followed by
Problem 7
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=2008_AIME_II_Problems/Problem_6&oldid=55455"