Let be the th Fibonacci number, where and . Which of the following is equal to
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Recall that f ( n + 1 0 ) = f ( n + 9 ) + f ( n + 8 ) by the recursive definition of the Fibonacci sequence. Continuing to simplify, we get f ( n + 9 ) + f ( n + 8 ) = 2 f ( n + 8 ) + f ( n + 7 ) . If we continue this pattern, we find that f ( n + 1 0 ) = 5 5 f ( n + 1 ) + 3 4 f ( n ) Therefore f ( n + 1 0 ) − f ( n ) = 5 5 f ( n + 1 ) + 3 3 f ( n ) . Using the recursive definition again, this simplifies to f ( n + 1 0 ) − f ( n ) = 3 3 f ( n + 2 ) + 2 2 f ( n + 1 ) . Repeating this process, we see that f ( n + 1 0 ) − f ( n ) = 1 1 f ( n + 5 ) Now notice that if n = 2 0 1 5 2 0 1 5 + 2 0 1 0 , then f ( 2 0 1 5 2 0 1 5 + 2 0 2 0 ) − f ( 2 0 1 5 2 0 1 5 + 2 0 1 0 ) = f ( n + 1 0 ) − f ( n ) . Therefore, the answer is 1 1 f ( n + 5 ) = 1 1 f ( 2 0 1 5 2 0 1 5 + 2 0 1 5 )