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: Fibonacci in understanding
Replies: 3   Last Post: Jan 23, 2008 1:00 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 1
Registered: 1/21/08
Fibonacci in understanding
Posted: Jan 21, 2008 11:32 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I have a question regarding the proof of a fibonacci statement.
I need some help understanding the basic concepts working through to the solution of this. If anyone is able to offer me some help I would appreciate it.
I will use 'E' as the summation sign.

I need to prove: Ei=1 to N-2Fi=FN-2 (note the i=1 is on the bottom of the summation sign and N-2 is on the top of it)

Now as proofs go, you first need to state what is obviously true and what can be assumed true based upon that. Which I can see that N=1 and N=2 are true.
Now for the part that I do not fully understand and I would like some help with:
E i=1 to k+1Fi=E i=1 to kFi+Fk+1 //need help with this line
Fk+2-2+Fk+1 = Fk+3-2 //also help with this line
N=k+1 as the final proof.

Thank you

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.