Let , , and for . How many terms in the sequence are even?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
Look only at odd or even. The terms go odd, odd, even, and that pattern repeats, so a term is even exactly when its position is a multiple of 3.
Solution
The terms get huge fast, but we only care whether each one is odd or even. Adding two numbers, whether the answer is odd or even depends only on whether the two numbers were odd or even.
1. Write out the first few terms.
2. Mark odd (O) and even (E).
| position | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|---|---|---|---|---|---|---|---|---|
| term | 1 | 3 | 4 | 7 | 11 | 18 | 29 | 47 | 76 |
| odd/even | O | O | E | O | O | E | O | O | E |
3. See why the pattern keeps going. Each term is the sum of the two before it:
- odd odd even,
- odd even odd,
- even odd odd,
and then we are back to "odd, odd", so the same three steps happen again. The pattern O, O, E repeats forever.
4. So a term is even exactly when its position is a multiple of .
5. Count the multiples of from to . They are . Since , there are of them. ( itself is not a multiple of .)
The answer is .
Why this works
In a sequence where each term is built from the terms just before it, "odd or even" also follows a rule that depends only on the terms just before it. There are only a few possible odd/even pairs, so the pattern has to repeat. Once you find the repeating block, the question becomes counting positions, which is easy even for a far-away term like number .
The trap
Miscounting the multiples of 3 up to 2023 (for example 675). Since 2023 is not a multiple of 3, the last even term is number 2022.
Concise solution
Only parity matters, and the parity of each term is determined by the parities of the two before it. The first few terms are
with parities odd, odd, even, odd, odd, even, Because odd odd even, odd even odd, and even odd odd, the pattern (odd, odd, even) repeats forever with period .
So is even exactly when is a multiple of . The multiples of from to are , and there are
of them.
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.1)
- Introduction to Number Theory, Chapter 10: Units Digits
Techniques
Use an invariant, parity, or coloring argument · Compute small cases, spot the pattern, generalize