- Published on
The Fibonacci Generating Function
- Authors

- Name
- Vu Hung
Problem Statement
Let be the -th Fibonacci number (). We define the power series as:
- By expanding and using the recurrence property of Fibonacci numbers, prove that:
- Given the growth rate of Fibonacci numbers, explain why this series converges for .
- Show that .
- The decimal expansion of is . Explain why the digit in the place is rather than the expected Fibonacci number .
Hints
Consider the definition of term by term for (i). For (iv), look closely at how the next Fibonacci number interacts with the decimal places.
Solutions
(i) Substitution into cancels out all terms except the first, leaving . Hence .
(ii) Fibonacci numbers grow roughly geometrically by the golden ratio . Because , the series converges.
(iii) Substitute :
(iv) The required sum gives . and , so the sum overlapping the place includes the carry-over from : .
Takeaways
- Power series generating functions can be explicitly derived using recurrence relations.
- The decimal expansion of fractions naturally encodes the base-10 carry-over of power series evaluations.
- Fibonacci recursion can also be visualised geometrically via a quarter-turn spiral whose radii follow consecutive Fibonacci numbers.
% % }
Further Readings
- HSC Polynomials: https://vumaths.com/booklets/hsc-polynomials/
- HSC Distributions: https://vumaths.com/booklets/hsc-distributions/
- HSC Combinatorics: https://vumaths.com/booklets/hsc-combinatorics/
- HSC Inequalities: https://vumaths.com/booklets/hsc-inequalities/
Connect with me
- Website - Vu's Maths Hub: https://vumaths.com/
- Instagram: https://www.instagram.com/vuhung16/
- GitHub: https://github.com/vuhung16au/
