The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: sum of Fibonacci numbers ...
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 58
Registered: 12/6/04
sum of Fibonacci numbers ...
Posted: Nov 20, 1999 4:28 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

My question is:

If F_n is the nth Fibonacci number, find a simple expression for
F_1 + F_2 + ... + F_n which involves F_p for only one p.

Doesn't this sum just reduce to F_(n+2) - 2 ??? To prove this I think
I could use induction (would this be the best way to do this?). Or
does this arguement show the result?...

Let S=F_1+F_2+...F_n
Make sum left and right sides below
S = 1+S-F_n+1+S-F_(n-1)-F_n=2+2S-F_n-F_(n+1)
from above

S=F_(n+2) - 2

Thank you for your time & assistance,

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.