Let , , and for . How many terms in the sequence are even?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
Parities go odd, odd, even and repeat with period 3, so L_n is even exactly when 3 divides n; count multiples of 3 up to 2023.
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 .
Why this works
A linear recursion taken modulo (or modulo any ) depends only on the previous residues, so it must eventually cycle; here the cycle appears immediately and has length . Reducing to residues turns a question about huge numbers into counting positions in a short repeating pattern, exactly as with Fibonacci numbers.
The trap
Rounding 2023/3 the wrong way (675) or assuming the last term is even; 2023 is not a multiple of 3, so the last even term is L_2022.
Common mistakes
- Rounding 2023/3 the wrong way (675) or assuming the last term is even; 2023 is not a multiple of 3, so the last even term is L_2022.
- Counting the odd terms () or the positions by mistake.
Techniques
Use an invariant, parity, or coloring argument · Compute small cases, spot the pattern, generalize