Home
Book
Learn
Library
Practice
Contact
Log In
BinomialExpansion
Symmetry
LinearRecursion
IMO
Challenging
Problem - 2695
Let sequence $\{a_n\}$ satisfy $a_0=0, a_1=1$, and $a_n = 2a_{n-1}+a_{n-2}$. Show that $2^k\mid n$ if and only if $2^k\mid a_n$.
report an error