Define fibonacci sequence using a recurrence relation.
Answers
Answered by
0
Let F(n) be the nth Fibonacci Number then,
F(n) = F(n-1) + F(n-2),
with initial conditions–
F(1) = 1 and F(2) = 1.
Now a days, these intial conditions are also written as–
F(0) = 0 and F(1) = 1.
Comment or message me for more, if needed. You may report this answer or notify me if something wrong found with this answer. Thanks!
F(n) = F(n-1) + F(n-2),
with initial conditions–
F(1) = 1 and F(2) = 1.
Now a days, these intial conditions are also written as–
F(0) = 0 and F(1) = 1.
Comment or message me for more, if needed. You may report this answer or notify me if something wrong found with this answer. Thanks!
Similar questions