This question already has an answer here:

May someone help me? I am trying to use induction to prove that the formula for finding the $n^{th}$ term of the Fibonacci sequence is:


I tried to put $n=1$ into the equation and prove that if $n=1$ works then $n=2$ works and it should work for any number but it didn't work. I need to prove that this formula gives the $n^{th}$ Fibonacci number.


merged by Jyrki Lahtonen Jan 22 '15 at 8:31

This question was merged with Inductive proof of a formula for Fibonacci numbers because it is an exact duplicate of that question.