Binet's formula provides an explicit closed form for Fibonacci numbers, demonstrating how characteristic equation methods yield exact solutions to important recurrence relations.
DefinitionBinet's Formula
The n-th Fibonacci number is given by:
Fn=5ϕn−ϕ^n
where ϕ=21+5≈1.618 (the golden ratio) and ϕ^=21−5≈−0.618.
Proof:
The Fibonacci sequence satisfies Fn=Fn−1+Fn−2 with F0=0 and F1=1.
Step 1: Find the characteristic equation.
For the recurrence Fn−Fn−1−Fn−2=0, the characteristic equation is:
r2−r−1=0
Step 2: Solve for the roots.
Using the quadratic formula:
r=21±1+4=21±5
Let ϕ=21+5 and ϕ^=21−5.
Step 3: Write the general solution.
Since we have two distinct real roots, the general solution is:
Fn=Aϕn+Bϕ^n
for some constants A and B.
Step 4: Apply initial conditions.
Using F0=0:
F0=A+B=0
So B=−A.
Using F1=1:
F1=Aϕ+Bϕ^=A(ϕ−ϕ^)=1
Now, ϕ−ϕ^=21+5−21−5=5.
Therefore: A⋅5=1, so A=51 and B=−51.
Step 5: Write the final formula.
Fn=51ϕn−51ϕ^n=5ϕn−ϕ^n
This completes the proof. □
Verification:
Let's verify for small values:
F0=5ϕ0−ϕ^0=51−1=0 ✓
F1=5ϕ−ϕ^=55=1 ✓
F2=5ϕ2−ϕ^2
Note that ϕ2=ϕ+1 (since ϕ satisfies r2=r+1) and similarly ϕ^2=ϕ^+1.
So F2=5(ϕ+1)−(ϕ^+1)=5ϕ−ϕ^=1 ✓
Remark
Several remarkable properties follow from Binet's formula:
Asymptotic growth: Since ∣ϕ^∣<1, we have ϕ^n→0 as n→∞. Therefore, Fn≈5ϕn, and Fn grows exponentially at rate ϕ≈1.618.
Rounding formula: For n≥0, Fn=⌊ϕn/5+1/2⌋ (nearest integer to ϕn/5).
GCD property:gcd(Fm,Fn)=Fgcd(m,n), which can be proven using properties of ϕ and ϕ^.
Cassini's identity:Fn−1Fn+1−Fn2=(−1)n, which follows from matrix representations or directly from Binet's formula.
Connection to Lucas numbers: The Lucas numbers Ln=ϕn+ϕ^n satisfy the same recurrence with different initial conditions, and Fn=(Ln−Ln−2)/2.
The golden ratio ϕ appears throughout mathematics, art, and nature, making the Fibonacci sequence one of the most studied in mathematics.