The Fibonacci numbers are defined by and for What is
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
The ratios F_{2n}/F_n are the Lucas numbers 1, 3, 4, 7, 11, ... with the same recurrence, so just add ten small terms.
Solution
List the first Fibonacci numbers:
Compute the first few ratios :
These are : each term is the sum of the previous two. This is no accident. The identity shows , and a sum of two Fibonacci-type sequences satisfies the same recurrence. (Check: .)
So continue the recurrence to ten terms:
Their sum is .
The answer is .
Why this works
The ratios are the Lucas numbers , a second Fibonacci-like sequence with starting values . Whenever a problem builds a new sequence out of Fibonacci numbers, compute a handful of terms and test whether they obey the same recurrence; if so, the whole problem reduces to small additions. The identity behind it, , is worth remembering.
Alternative approach
Brute force: extend the list to and divide each even-indexed term by the corresponding term (, , , ). Same ten numbers, sum .
The trap
Arithmetic slips while computing Fibonacci numbers up to F_20 = 6765 and dividing; the recurrence on the ratios avoids all large numbers.
Common mistakes
- Arithmetic slips while computing Fibonacci numbers up to F_20 = 6765 and dividing; the recurrence on the ratios avoids all large numbers.
- Starting the ratio sequence at and dropping the first term , giving .
Techniques
Set up the equation/formula and compute; no special trick needed · Compute small cases, spot the pattern, generalize