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



TMMM
Posts:
1
Registered:
1/21/08


Fibonacci proof...help in understanding
Posted:
Jan 21, 2008 11:32 PM


Hi, 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 N2Fi=FN2 (note the i=1 is on the bottom of the summation sign and N2 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 hence Fk+22+Fk+1 = Fk+32 //also help with this line N=k+1 as the final proof.
Thank you Ted



