GATE | GATE CS 1996 | Question 57

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

fn+2 = fn+1 + fn, n ≥ 1; f= 1 : f= 1

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



Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.