Share
Explore BrainMass

Explore BrainMass

Fibonacci numbers: F 2n+1 - Fn Fn+2 = (-1) n

Application of Mathematical Induction

Application of Mathematical Induction

Fibonacci Numbers :- The Fibonacci numbers are numbers that has the following properties.

If Fn represents the nth Fibonacci number,

F1 = 1, F2 =1, F3 =2, F4=3, F5 = 5 etc.

We can find the Fibonacci numbers which are≥ 3 by using the relation

Fn= Fn-1 + Fn-2 for n ≥ 3

Application of mathematical Induction

Prove that
F 2n+1 - Fn Fn+2 = (-1) n

Attachments

Solution This solution is FREE courtesy of BrainMass!

Application of Mathematical Induction

Application of Mathematical Induction

Mathematical Induction :- If a statement is true in the first case and if it is true for all the cases preceding a given one then the
statement is true for this case.

Fibonacci Numbers :- The Fibonacci numbers are numbers that has the following properties.

If Fn represents the nth Fibonacci number,

F1 = 1, F2 =1, F3 =2, F4=3, F5 = 5 etc.

We can find the Fibonacci numbers which are≥ 3 by using the relation

Fn= Fn-1 + Fn-2 for n ≥ 3

Application of mathematical Induction

To prove
F 2n+1 - Fn Fn+2 = (-1) n