Hello All,

I am thoroughly lost with how to construct this proof:

Let F(sub)n be the nth Fibonacci number.

Prove that, if 3|n then 2|F(sub)n.

Would induction be a recommendation, and if so, could anyone please recommend a base assumption to begin with?

Thank you very much for your time,

Panglot