Binet formula for the Fibonacci numbers
Question
The Fibonacci numbers satisfy , and . Find an explicit formula for .
Short answer
with , . Try : the recursion gives , whose roots are . The general solution fitted to gives .
Adapted from Joshi, Denson & Downes, Quant Job Interview Questions and Answers, Q6.3, p.189; question and answer rewritten by SelfMadeQuant.com.
See the hint and the full worked solution in the question bank (free account).
Open the worked solution