3.0 Algebra Number Theory

Parity Pattern in a Recurrence Relation

Author: SolveSheep

Let \( a_n \) be a sequence defined by \( a_1=1, a_2=2 \), and \( a_{n+2} = 2a_{n+1} + a_n \) for \( n \ge 1 \).
Prove by induction that \( a_n \) is even if and only if \( n \) is a multiple of 3.




Not logged in? Click here to log in.