Engineering-Mathematics
October 3, 2023NTA UGC NET DEC-2022 Paper-2
October 3, 2023Recurrence-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.
Theory Explanation.
|
Correct Answer: A
Subscribe
Login
0 Comments