Prove, by induction, the Simpson formula (or Simpson identity) for the Fibonacci numbers f n {\displaystyle {}f_{n}} . It says ( n ≥ 2 {\displaystyle {}n\geq 2} )