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.
Answer:
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post