Hi
Demonstration by recurrence is possible
Start by demonstrating that F4 is divisible by 3
Then suppose that F(4n) is divisible by 3
and demonstrate that F(4n+4) is divisible by 3
This is possible by decomposing F(4n+4)=F(4n+3)+F(4n+2) etc
I need urgent help with this problem.I was googling for some induction prrof and I stumbled upon this one.I have my exam in 45 mins.Can somebody pleas ehelp me with this induction prrof:
it says: prove that every 4nth fibonacci number is divisible by 3.Please help
Thanks,