You should really start by telling us what tools you have to work with.
Either way, you should try Wikipedia first: Fibonacci number - Wikipedia, the free encyclopedia.
You should really start by telling us what tools you have to work with.
Either way, you should try Wikipedia first: Fibonacci number - Wikipedia, the free encyclopedia.
Thank you. Part of my problem is that the tools haven't really been defined. I am in a Combinatorics class and all I was told was to derive the formula. Actually, I have seen a version of the derivation that seeks a solution of the form f_n =q^n, q <> 0, but I am not sure what lead the writer to this approach. It seems to me that whatever prompted that approach is key to the whole thing. The rest of the steps are just algebra.
Hello, tarheelborn!
If you've never seen a derivation for a recursive functions,
. . these moves will seem like Black Magic.
I need to derive Binet's formula and I don't know how to start.
The Fibonacci Sequence can be expressed like this:
. .
The sequence begins with 1 and 1; each subsequent term is the sum of the preceding two terms.
We assume that is an exponential function: .
The equation becomes:
. .
Divide by
Quadratic Formula: .
Form a linear combination of the roots:
. .
Use the first two terms of the sequence:
. .
Solve the system of equations: .
Hence: .
. . . . . .