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?
(In reply to
re: what is being asked??? by Charlie)
"The formula given so far for that is F(k+2); in this instance that is F(5+2)=F(7)=12."
Whoops! The formula is F(0)+ F(1)+F(2)+...+F(n) = F(n+2) - 1.
F(7) = 13, not 12.
|
|
Posted by Richard
on 2004-07-15 22:17:37 |
re(2): what is being asked???
