The Fibonacci series is traditionally defined recursively, yet there also exists an
explicit formula. Binet’s formula is this explicit definition and we will prove that it
is equivalent to the recursive definition via the principal of mathematical induction.
A brief discussion on phyllotaxy and dynamics and a proof of the irrationality of the
golden ratio are also present.