For the Fibonacci numbers , , the identity holds for . It follows by induction: replacing each term using the Fibonacci recurrence negates the left-hand side when increases by one, and the value at is .
New to topics? Read the docs here!
New to topics? Read the docs here!