Fibonacci Numbers - Power Series

Power Series

The generating function of the Fibonacci sequence is the power series

This series has a simple and interesting closed-form solution for :

This solution can be proven by using the Fibonacci recurrence to expand each coefficient in the infinite sum defining :

\begin{align} s(x) &= \sum_{k=0}^{\infty} F_k x^k \\ &= F_0 + F_1x + \sum_{k=2}^{\infty} \left( F_{k-1} + F_{k-2} \right) x^k \\ &= x + \sum_{k=2}^{\infty} F_{k-1} x^k + \sum_{k=2}^{\infty} F_{k-2} x^k \\ &= x + x\sum_{k=0}^{\infty} F_k x^k + x^2\sum_{k=0}^{\infty} F_k x^k \\ &= x + x s(x) + x^2 s(x). \end{align}

Solving the equation for results in the closed form solution.

In particular, math puzzle-books note the curious value, or more generally

for all integers .

More generally,

Read more about this topic:  Fibonacci Numbers

Famous quotes containing the words power and/or series:

    “When power becomes gracious and descends into the visible—such descent I call beauty.”
    —Friedrich Nietzsche (1844–1900)

    “If the technology cannot shoulder the entire burden of strategic change, it nevertheless can set into motion a series of dynamics that present an important challenge to imperative control and the industrial division of labor. The more blurred the distinction between what workers know and what managers know, the more fragile and pointless any traditional relationships of domination and subordination between them will become.”
    —Shoshana Zuboff (b. 1951)