Choose the recursive formula for the Fibonacci series.(n $\geq$ 1)

F(n) = F(n+1) + F(n+2)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

F(n) = F(n) + F(n+1)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

F(n) = F(n-1) + F(n-2)

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

F(n) = F(n-1) – F(n-2)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C F(n) = F(n-1) + F(n-2)
F(n) = F(n-1) + F(n-2)

Suggest Corrections

Similar questions

a_{k + 1} = 3 a_{k}

a_{1} = 2

a_{k + 1} = a_{k} + 3

a_{1} = 7

a_{k + 1} = a_{k} + 3

a_{1} = 7

Join BYJU'S Learning Program