Exercise 1490Calculus › Single-variable calculus › Series › Power seriesL2Added 2 Nov 2026
The generating function of Fibonacci numbers
#generating function#Fibonacci#partial fractions#radius of convergence
Statement
Let F0=0, F1=1, Fn+2=Fn+1+Fn and G(x)=∑n≥0Fnxn.
Show that G(x)=1−x−x2x where the series converges.
Find the radius of convergence of G.
Recover Binet's formula for Fn.
Hint
Multiply the recurrence by xn+2 and sum. For part 3, decompose 1−x−x21 into partial fractions with φ=21+5 and ψ=21−5, noting 1−x−x2=(1−φx)(1−ψx).
Show solutionHide solution
Solution
1. Multiply Fn+2=Fn+1+Fn by xn+2 and sum over n≥0: G(x)−F0−F1x=n≥2∑Fnxn=n≥0∑Fn+2xn+2=n≥0∑Fn+1xn+2+n≥0∑Fnxn+2=x(G(x)−F0)+x2G(x), so G(x)−x=xG(x)+x2G(x) and G(x)=1−x−x2x.
2. The singularities of G are the roots of 1−x−x2, namely −φ and −ψ=φ1≈0.618. The smaller in absolute value is φ1, so R=φ1=25−1. (This agrees with Fn+1Fn→φ1.)
3. Since 1−x−x2=(1−φx)(1−ψx) and φ−ψ=5, (1−φx)(1−ψx)x=51(1−φx1−1−ψx1)=51n≥0∑(φn−ψn)xn. Identifying coefficients: Fn=5φn−ψn.