Difference between revisions of "2007 AIME I Problems/Problem 14"
m (→Solution) |
ZzZzZzZzZzZz (talk | contribs) (→Solution) |
||
Line 12: | Line 12: | ||
Add these two equations to get | Add these two equations to get | ||
− | :<math> | + | :<math>a_{n-1}(a_{n-1}+a_{n+1}) = a_{n}(a_{n}+a_{n-2})</math> |
:<math>\frac{a_{n+1}+a_{n-1}}{a_{n}}= \frac{a_{n}+a_{n-2}}{a_{n-1}}</math>. | :<math>\frac{a_{n+1}+a_{n-1}}{a_{n}}= \frac{a_{n}+a_{n-2}}{a_{n-1}}</math>. | ||
Line 22: | Line 22: | ||
We can thus calculate that <math>b_{2007}+\frac{1}{b_{2006}}= b_{3}+\frac{1}{b_{2}}= 225</math>. Now notice that <math>b_{2007}= \frac{a_{2007}}{a_{2006}}= \frac{a_{2006}^{2}+2007}{a_{2006}a_{2005}}> \frac{a_{2006}}{a_{2005}}= b_{2006}</math>. This means that | We can thus calculate that <math>b_{2007}+\frac{1}{b_{2006}}= b_{3}+\frac{1}{b_{2}}= 225</math>. Now notice that <math>b_{2007}= \frac{a_{2007}}{a_{2006}}= \frac{a_{2006}^{2}+2007}{a_{2006}a_{2005}}> \frac{a_{2006}}{a_{2005}}= b_{2006}</math>. This means that | ||
− | <math>b_{2007}+\frac{1}{b_{2007}}< b_{2007}+\frac{1}{b_{2006}}= 225</math>. | + | <math>b_{2007}+\frac{1}{b_{2007}}< b_{2007}+\frac{1}{b_{2006}}= 225</math>. It is only a tiny bit less because all the <math>b_i</math> are greater than <math>1</math>, so we conclude that the floor of <math>\frac{a_{2007}^{2}+a_{2006}^{2}}{a_{2007}a_{2006}}= b_{2007}+\frac{1}{b_{2007}}</math> is <math>224</math>. |
== See also == | == See also == |
Revision as of 17:09, 19 January 2008
Problem
A sequence is defined over non-negative integral indexes in the following way: , .
Find the greatest integer that does not exceed
Solution
We are given that
, .
Add these two equations to get
- .
This is an invariant. Defining for each , the above equation means
.
We can thus calculate that . Now notice that . This means that
. It is only a tiny bit less because all the are greater than , so we conclude that the floor of is .
See also
2007 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |