#1 – Introduction and Deriving the Fibonacci Sequence – 3/9/25
Paul N -
Welcome to my Senior Project! My name is Paul, and in this project, I am exploring the interconnectedness of various disciplines of mathematics by learning about these disciplines and studying the ways in which they can be related to each other. Specifically, I will be studying the fields of sequences, proofs, number theory, geometry, algebra, real analysis, complex analysis, topology, differential equations, and applied mathematics. Each week of my project will be dedicated to learning about one of these topics, though since I am exploring the interconnectedness of these fields, the structure of the course will likely end up being rather loose, and each topic will appear several times as we discuss each of the other topics.
In accordance with this structure, this week’s field of study was sequences, and though there were dozens of different sequences we studied throughout the course of the week, perhaps one of the most notable was the well-known Fibonacci sequence. For those who are unfamiliar with this sequence, the Fibonacci sequence is defined such that the first two terms are equal to one and the rest of the terms are equal to the previous two terms added to each other. In mathematical notation:
fn+2=fn+1+fn
Thus, the Fibonacci sequence’s first few terms are as follows: 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on. Our goal was to derive a formula for the Fibonacci sequence using what is commonly referred to as a generating function, or in other words, a function whose Taylor series expansion returns the sequence in question. To do this, allow us to define the following function:
f(x) = 1 + x + 2x2+3x3+5x4+8x5+13x6+…
Note that the coefficient of each term in the polynomial is equal to the nth term of the Fibonacci sequence. Then, let’s take another look at the definition of the Fibonacci sequence from before, and multiply both sides by xn:
fn+2xn=fn+1xn+fnxn
Plugging in the first few values of n, we obtain the following system of equations:
2 = 1 + 1
3x = 2x + x
5x2 = 3x2 + 2x2
8x3 = 5x3 + 3x3
13x4 = 8x4 + 5x4
And so on. Notice that, by adding this system of equations together, we get that:
(2 + 3x + 5x2 + 8x3 + 13x4 + …) = (1 + 2x + 3x2 + 5x3 + 8x4 + …) + (1 + x + 2x2 + 3x3 + 5x4 + …)
Recalling the polynomial definition of f(x) from earlier, we can rewrite this as the following:
(f(x) – x – 1)/x2 = (f(x) – 1)/x + f(x)
Rearranging for f(x), we get:
f(x) = x/(1 – x – x2)
This is our generating function, whose Taylor series expansion will allow us to find a formula for the Fibonacci sequence. To find the Taylor series expansion of this function, allow us to separate this fraction into two separate fractions using partial fractions:
x/(1 – x – x2) = A/(1 – αx) + B/(1 – βx)
For now, the values of α and β are unimportant. Now solve for A and B:
x = A(1 – βx) + B(1 – αx)
1/α = A(1 – β/α)
A = 1/(α – β)
A + B = 0
B = -A = -1/(α – β)
Now, we have obtained the following:
f(x) = (1/(1 – αx) – 1/(1 – βx))/(α – β)
Recall that the Taylor series expansion of a function of the form 1/(1 – rx) is equal to the following:
1/(1 – rx) = 1 + rx + r2x2 + r3x3 + …
Thus:
f(x) = ((1 + αx + α2x2 + α3x3 + …) – (1 + βx + β2x2 + β3x3 + …))/(α – β) = ((α – β)x + (α2 – β2)x2 + (α3 – β3)x3 + …)/(α – β)
Remember that the nth coefficient of this series is equal to the nth term of the Fibonacci sequence. Thus, we now have the Fibonacci sequence:
F(n) = (αn – βn)/(α – β)
Before we can fully understand this formula, we must find the values of α and β. This can be done as follows:
(1 – αx)(1 – βx) = 1 – (α + β)x + αβx2 = 1 – x – x2
α + β = 1
αβ = -1
β = -1/α
α – 1/α = 1
α2 – α – 1 = 0
α = (1 ± √(1 + 4))/2 = (1 ± √5)/2
β = – 2/(1 ± √5)
If we assume that α is taking the positive root of 5, then it turns out that α is equal to the golden ratio, φ:
φ = (1 + √5)/2
Then:
β = -1/φ
Now, we can express our formula for the Fibonacci sequence as the following:
F(n) = (φn – (-1/φ)n)/(φ + 1/φ) = (φn – (-1/φ)n)/√5
Notice that, for plugging in for different values of n, the formula works:
F(1) = 1
F(2) = 1
F(3) = 2
F(4) = 3
F(5) = 5
And so on. Thus, we have successfully derived a formula for the Fibonacci sequence.
Comments:
All viewpoints are welcome but profane, threatening, disrespectful, or harassing comments will not be tolerated and are subject to moderation up to, and including, full deletion.