Hello,

I thought I had solved this problem; however, I did realize that they did not want us using the fact that the fibonacci sequence modulo n for some n contained in N yields an infinitely recursive sequence that returns a 0 for each term indexed as a multiple of n. As a result, I am at a loss on how to approach the problem.

Let n N.

Prove that 2 | F_n if and only if 3 | n.

Thank you for your help

All the best