The Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13, in which each number is the sum of the two previous, is defined as F(0)=0, F(1)=1, and F(n)=F(n-1)+F(n-2) for n>1.

What is the sum of F(0)+F(1)+F(2)+...+F(k)?
What is the sum of F(0)^2+F(1)^2+F(2)^2+...+F(k)^2?

There should be a formula to figure any given F(k), as posted before.

Isn't this question asking the sum of all these F(k)'s??

If so, wouldn't the answer to both be infinity? (second question just gets there a lot faster)?

Posted by Jim on 2004-07-15 15:45:34