A function is defined recursively by and for all integers . What is ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Work out the first dozen values. Every 6 steps the value goes up by exactly 6, so jump from f(2) to f(2018) in steps of 6.
Solution
The rule is easy to use, so compute values and look for a pattern.
- A table. Each value is the previous one, minus the one before that, plus .
For example, and .
2. Spot the pattern. Compare each value with the one places earlier: , , , , and so on. Each value is more than the value steps back:
3. Why it keeps going. Write the rule for and for :
Put the second into the first. The terms cancel, leaving
Use this again with in place of : . Substituting,
4. Jump to 2018. , so from we take jumps of steps, each adding :
The answer is .
Why this works
When a rule is simple to apply, a table of the first several values often shows a repeating pattern. Here the pattern repeats every steps with a steady climb of . Once you have a "jump" rule like that, reach a far-away value by counting jumps from a small value with the same remainder.
Alternative approach
Look at the gap in the table: , then again . It repeats every . Since leaves remainder when divided by , it matches , where the gap is . So .
The trap
Computing a few values, seeing f(n) close to n, and guessing f(2018) = 2018 or 2019. The gap between f(n) and n changes in a cycle of 6.
Concise solution
Write the recursion for and for :
Adding them cancels and :
Apply this twice: , so
So stepping the index by raises by exactly . Since ,
The answer is .
Review in the AoPS books
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Introduction to Algebra, Chapter 16: Functions
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.1)
- Intermediate Algebra, Chapter 17: More Sequences and Series (§17.1, §17.2)
Techniques
Compute small cases, spot the pattern, generalize · Collapse a sum or product by cancellation