Difference between revisions of "1997 AIME Problems/Problem 9"
(sol) |
(→Solution) |
||
Line 10: | Line 10: | ||
Note that to determine our answer, we could have also used other properties of <math>\phi</math> like <math>\phi^3 = 2\phi + 1</math>. | Note that to determine our answer, we could have also used other properties of <math>\phi</math> like <math>\phi^3 = 2\phi + 1</math>. | ||
+ | |||
+ | == Solution 2 == | ||
+ | Find <math>a</math> as shown above. Note that <math>a</math> satisfies the equation <math>a^2 = a+1</math> (this is the equation we solved to get it). Then, we can simplify <math>a^{12}</math> as follows using the fibonacci numbers: | ||
+ | |||
+ | <math>a^{12} = a^{11}+a^{10}= 2a^{10} + a^{9} = 3a^8+ 2a^9 = ... = 144a^1+89a^0 = 144a+89</math> | ||
+ | |||
+ | So we want <math>144(a-\frac1a)+89 = 144(1)+89 = \boxed{233}</math> since <math>a-\frac1a = 1</math> is equivalent to <math>a^2 = a+1</math>. | ||
== See also == | == See also == |
Revision as of 17:41, 15 March 2009
Contents
Problem
Given a nonnegative real number , let denote the fractional part of ; that is, , where denotes the greatest integer less than or equal to . Suppose that is positive, , and . Find the value of .
Solution
Looking at the properties of the number, it is immediately guess-able that (the golden ratio) is the answer. The following is the way to derive that:
Since , . Thus , and it follows that . Noting that is a root, this factors to , so (we discard the negative root).
Our answer is . Complex conjugates reduce the second term to . The first term we can expand by the binomial theorem to get . The answer is .
Note that to determine our answer, we could have also used other properties of like .
Solution 2
Find as shown above. Note that satisfies the equation (this is the equation we solved to get it). Then, we can simplify as follows using the fibonacci numbers:
So we want since is equivalent to .
See also
1997 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |