Like every sequence defined by linear recurrence, the Fibonacci numbers have a closed-form solution. It has become very well known as Binet‘s formula, even though it was already known by Abraham de Moivre:
follows from the defining equation above.
The Fibonacci recursion
is similar to the defining equation of the golden ratio in the form
which is also known as the generating polynomial of the recursion.