Factor the denominator: 1−x−x2=−(x−ϕ)(x−ϕ^) where ϕ=21+5 and ϕ^=21−5 are roots of x2=x+1, or equivalently, 1=x+x2.
Actually, solving 1−x−x2=0 gives x=2−1±5, so the roots are −ϕ^ and −ϕ. We can write:
1−x−x2=(1−ϕx)(1−ϕ^x)⋅(−ϕϕ^)
Note that ϕ⋅ϕ^=21+5⋅21−5=41−5=−1.
So: 1−x−x2=−(1/ϕ)(1/ϕ^)(1−ϕx)(1−ϕ^x)=−(−1)(1−ϕx)(1−ϕ^x)=(1−ϕx)(1−ϕ^x)
Wait, let me recalculate. If r is a root of r2=r+1, then 1=r+r2, so 1−r−r2=0. The polynomial 1−x−x2 has roots where x=ϕ and x=ϕ^... Actually, I need to be more careful.
The characteristic equation of Fn=Fn−1+Fn−2 is r2=r+1, with roots ϕ and ϕ^.
For the generating function denominator 1−x−x2, setting equal to zero: x2+x−1=0, giving x=2−1±5. These are −ϕ^ and −1/ϕ (since 1/ϕ=ϕ−1=ϕ^ from ϕ2=ϕ+1).
Using partial fractions:
1−x−x2x=(1−ϕx)(1−ϕ^x)x=1−ϕxA+1−ϕ^xB
Comparing coefficients: Fn=5ϕn−ϕ^n, which is Binet's formula. □
Remark
This derivation illustrates the power of generating functions to bridge recurrences and closed forms. The generating function encodes all sequence values simultaneously, and algebraic manipulation reveals the underlying structure. This method generalizes to any linear recurrence with constant coefficients, always producing rational generating functions whose partial fraction decompositions yield closed formulas.