A sequence of numbers is defined recursively by , , and for all . Then can be written as , where and are relatively prime positive integers. What is
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
Flip the recursion: 1/a_n = 2/a_(n-1) - 1/a_(n-2), so the reciprocals form an arithmetic sequence with first term 1 and common difference 4/3.
Solution
The recursion has a product in the numerator and a difference in the denominator, which suggests taking reciprocals:
Setting gives , i.e. : the form an arithmetic sequence.
Its first two terms are and , so the common difference is and
Then , so . Since is not a multiple of , the fraction is reduced, and .
The answer is .
Why this works
A recursion of the form becomes linear in the reciprocals, and a linear recursion with coefficients and means constant differences. Whenever a recursion looks like a harmonic-mean formula, flip it. Computing and by hand shows the same pattern and is a good sanity check.
Alternative approach
Compute a few terms: , . Denominators increase by , so and .
The trap
Mis-indexing the arithmetic sequence of reciprocals (using 4n+3 or 4n-5 instead of 4n-1), or grinding out fractions term by term instead of flipping the recursion.
Common mistakes
- Mis-indexing the arithmetic sequence of reciprocals (using 4n+3 or 4n-5 instead of 4n-1), or grinding out fractions term by term instead of flipping the recursion.
- Writing the numerator as instead of (pattern ), which leads to near or .
Techniques
Compute small cases, spot the pattern, generalize · Substitute to simplify (u = x+1/x, shifting, scaling)