You don’t have to be a mathematician to appreciate the wonderful symmetry of some mathematical formula. Here’s one formula I am especially fond of. It’s called **Binet’s formula **for the *n*th term of a Fibonacci sequence. The formula is named after the French mathematician and physicist, **Jacques Philippe Marie Binet** (1786 – 1856) who made fundamental contributions to number theory and matrix algebra.

**Binet’s Formula**

There are three reasons why I’m enchanted by this formula. First, it relates to the intriguing **Fibonacci sequence**: 0, 1, 1, 2, 3, 5, 8, etc. which captures a distinctive growth pattern. In its original appearance in the 13th century publication by Leonardo of Pisa (also known as **Leonardo Fibonacci**), this growth pattern was that of a rabbit population. The following passage, translated from Leonardo’s book reads:

*In the first month, start with a pair of baby rabbits. One month later, they have grown up. The following month, the pair of grown rabbits produce a pair of babies, so now we have one pair of grown rabbits and one pair of baby rabbits. Each month thereafter, each pair of grown rabbits produce a new pair of babies, and every pair of baby rabbits grows up. How many pairs of rabbits will there be at the end of one year?*

Well, the answer to that question is 233 pairs of rabbits (i.e., after the 12th month is completed). Rabbit problems have intrigued people ever since. More seriously, they have found many applications in many areas of computer science such as search algorithms and cryptography.

The second reason why I am fascinated with Binet’s formula is that the famous **Golden Ratio** is explicit in the formula. Due to its symmetry properties, this ratio has shaped art and architecture throughout human history. The Golden Ratio is the expression for in the formula, where

Thirdly, because the Fibonacci sequence grows very quickly, the *n*th term for large *n* is a very huge number. For example, the 31st term is already larger than one million. By the time we reach the 45th term, there are more than one billion pair of rabbits! So it is nice to have a formula that gives an accurate answer for *n*th term of the Fibonacci sequence relatively quickly. This is exactly what Binet’s formula does.

For these reasons, I really think that Binet’s formula is super cool. Not only is it beautiful to look, it is also practical.

For those who are curious, two questions arise: first, how did Binet’s formula came about? And second, is it connected to number series other than the Fibonacci sequence? In the rest of this blog, I will attempt to answer both questions. **Note: if you don’t feel like going any further, skip the rest of the post. You already had the pleasure of seeing an elegant formula, arguably one of the most famous in number theory**.

Let’s proceed to clear the mystery of how Binet’s formula came about. I’ll start from the beginning. The Fibonacci sequence is and its generating function is

=

where the coefficient of the terms involving *x* are the elements of the Fibonacci sequence (ignoring the first term, zero).

The Fibonacci sequence is an example of a **recursive function**, where

thus giving and nd so on.

Making use of the recursive function, and after some algebra, we can show that

This gives us an equation where we can solve for to obtain the beautiful formula for the Fibonacci generating function:

The denominator is a polynomial whose roots are which in turn are the reciprocals of the two numbers

Next, we use the idea of partial fractions to split the function into the sum of two pieces as follows:

After some manipulations, we find that

Substituting the values for and from (2) into the above expression, we have

This allows us to factor the polynomial as

Thus, can be written as

At this juncture, another number sequence – the **geometric series** – comes into the picture. The geometric series is . It converges to . Similarly,

Substituting these two expressions into (3) allows us to write as a power series

But we know from (1) that is the generating function for the Fibonacci sequence . Therefore, matching the two series for , we find that

Since we know that , the general equation for the *n*th term of is therefore

Bravo! We have cleared the mystery of how Binet’s formula came about. Along the way, we saw that it made contact with the geometric series which pops up in many scientific and finance applications.

**Further reading**

Joseph H. Silverman, *A Friendly Introduction to Number Theory*, Pearson, 4th ed., 2014.