Community Tip - Did you get an answer that solved your problem? Please mark it as an Accepted Solution so others with the same problem can find the answer easily. X
Fibonacci - so many formulas, so few time ...
Given that its not a Mathcad questions and probably also can't be done/proven with Mathcad, I guess chances are rather low that anyone will present a formal proof here.
Maybe you find here
http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibFormulae.html
and/or in the reference section at the end something of interest.
Maybe you are especially interested at Vajda
https://www.amazon.com/exec/obidos/ASIN/0486462765/fibonacnumbersan
or Johnson
Fibonacci - so many formulas, so few time ...
Given that its not a Mathcad questions and probably also can't be done/proven with Mathcad, I guess chances are rather low that anyone will present a formal proof here.
Maybe you find here
http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibFormulae.html
and/or in the reference section at the end something of interest.
Maybe you are especially interested at Vajda
https://www.amazon.com/exec/obidos/ASIN/0486462765/fibonacnumbersan
or Johnson
Many thanks for your time and help, Werner.
Regards.
Hello, Everyone again.
I think my question should be : "Need help having a proof of "
Thanks in advance.
and a equivalent question is :
Thanks in advance.