The numbers 1,2,3,5,8, ..... are called Fibonacci numbers. They may be defined by induction as n2...

Transcribed Image Text:

The numbers 1,2,3,5,8, ..... are called Fibonacci numbers. They may be defined by induction as n2 follows: a₁ = 1, a₂ = 2,..., an+1 = an + an-₁, if n ≥ 2. Prove that an = (¹+√5) for every 2 n≥ 1. The numbers 1,2,3,5,8, ..... are called Fibonacci numbers. They may be defined by induction as n2 follows: a₁ = 1, a₂ = 2,..., an+1 = an + an-₁, if n ≥ 2. Prove that an = (¹+√5) for every 2 n≥ 1.

Answer rating: 100% (QA)

solt To prove put n1 a Prove to ati at 2 a 15 15 The equati... View the full answer