AoPSWiki
The Art of Problem Solving Bookstore now offers two titles from the creator of Math Olympiads in the Elementary and Middle Schools. Click here and here to check them out.
Personal tools

2007 AIME I Problems/Problem 14

From AoPSWiki

Problem

A sequence is defined over non-negative integral indexes in the following way: , .

Find the greatest integer that does not exceed \frac{a_{2006}^{2}+a_{2007}^{2}}{a_{2006}a_{2007}}

Solution

We are given that

, a_{n-1}^{2}+2007 = a_{n}a_{n-2}.

Add these two equations to get

a_{n-1}(a_{n-1}+a_{n+1}) = a_{n}(a_{n}+a_{n-2})
\frac{a_{n+1}+a_{n-1}}{a_{n}}= \frac{a_{n}+a_{n-2}}{a_{n-1}}.

This is an invariant. Defining for each , the above equation means

b_{n+1}+\frac{1}{b_{n}}= b_{n}+\frac{1}{b_{n-1}}.

We can thus calculate that b_{2007}+\frac{1}{b_{2006}}= b_{3}+\frac{1}{b_{2}}= 225. Now notice that b_{2007}= \frac{a_{2007}}{a_{2006}}= \frac{a_{2006}^{2}+2007}{a_{2006}a_{2005}}> \frac{a_{2006}}{a_{2005}}= b_{2006}. This means that

b_{2007}+\frac{1}{b_{2007}}< b_{2007}+\frac{1}{b_{2006}}= 225. It is only a tiny bit less because all the are greater than , so we conclude that the floor of \frac{a_{2007}^{2}+a_{2006}^{2}}{a_{2007}a_{2006}}= b_{2007}+\frac{1}{b_{2007}} is .

See also

2007 AIME I (ProblemsResources)
Preceded by
Problem 13
Followed by
Problem 15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Support local problem solving programs by contributing to the Art of Problem Solving Foundation.
Click here for more information about the Foundation.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us