Share
Explore BrainMass

Explore BrainMass

Theory of Numbers : Fibonacci Number

Suppose that F1 = 1, F2 = 1, F3 =1, F4 = 3, F5 = 5, and in general Fn = Fn-1 + Fn-2 for n ≥ 3 ( Fn is called the nth Fibonacci number.) Prove that F1 + F2 + F3 +...+ Fn = F(n + 2) - 1

Attachments

Solution This solution is FREE courtesy of BrainMass!

Please see the attached file for the complete solution.
Thanks for using BrainMass.

Attachments