The Fibonacci numbers are among the most prolific of number sequences, perhaps second only to the Catalan numbers. They can be defined recursively, but one may ask if there exists a closed formula for the sequence. This is answered by Binet’s formula, which takes on a form so strange that it is hard to believe that it can ever even output an integer. We prove Binet’s formula in this video using the technique of generating functions.
