answersLogoWhite

0

Each term, except the first two, in the Fibonacci sequence is defined in terms of terms that went earlier in the sequence. That is the meaning of "recursive".

t(1) = 1

t(2) = 1

t(n+2) = t(n) + t(n+1) for n = 1, 2, 3, ...

User Avatar

Wiki User

9y ago

Still curious? Ask our experts.

Chat with our AI personalities

CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran

Add your answer:

Earn +20 pts
Q: Why is Fibonacci recursive?
Write your answer...
Submit
Still have questions?
magnify glass
imp