Recurrence-Relation

Question 1

The Fibonacci sequence {f1,f2,f3,...,fn} is defined by the following recurrence:

   fn+2 = fn+1 + fn, n ≥ 1; f2=1 : f1=1 

Prove by induction that every third element of the sequence is even.

A
Theory Explanation.
There is 1 question to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

Register Now

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access