All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Fibonacci sums (Posted on 2004-07-15) Difficulty: 3 of 5
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?

See The Solution Submitted by Federico Kereki    
Rating: 3.7143 (7 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionSolution To Part BK Sengupta2007-05-31 06:14:01
SolutionSolution To Part AK Sengupta2007-05-31 06:12:27
intuition behind the solution for part IIBon2004-08-04 18:59:48
intuition behind the solution for part IBon2004-08-04 18:34:07
Hints/Tipssolved by inductionMohammad2004-07-17 23:42:49
SolutionPart 1 solution + explanationTristan2004-07-16 15:52:57
SolutionMarginally more elegant solution for SquareHew BG2004-07-16 07:25:19
MoreRichard2004-07-15 22:54:46
re(2): what is being asked???Richard2004-07-15 22:17:37
re: what is being asked???Charlie2004-07-15 22:00:20
what is being asked???Jim2004-07-15 15:45:34
re: Inelegant solutionCharlie2004-07-15 15:35:57
SolutionInelegant solutionBryan2004-07-15 14:53:26
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information