Prove by induction the Binet formula for the Fibonacci numbers. This says that
holds ( n ≥ 1 {\displaystyle {}n\geq 1} ).