Here is the question:(adsbygoogle = window.adsbygoogle || []).push({});

------

Prove that [itex]f_{n}[/itex] is even if and only if n is divisible by 3. ([itex]f_{n}[/itex] is of course the nth Fibonacci number)

------

Proving that n is divisible by 3 => [itex]f_{n}[/itex] is even is easily done by induction, but the other implication is eluding me. It is easy to show that [itex]f_{n}[/itex] is even iff [itex]f_{n-3}[/itex] is even, but I can't see if this helps. Any ideas about how to prove this implication? Thanks.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Fibonacci sequence, division

**Physics Forums | Science Articles, Homework Help, Discussion**