Asked by Reiny
There is no function equation for the Fibonacci numbers, you have to use a Recursion formula.
F(n) = F(n-1) + F(n-2) for n>2 and F(1)=1, F(2)=1
what is the equation for the fibonacci sequence
F(n) = F(n-1) + F(n-2) for n>2 and F(1)=1, F(2)=1
what is the equation for the fibonacci sequence
Answers
Answered by
oobleck
Actually, there are a number of closed forms for Fn, but they are usually complicated. For example, Fn =
floor((n-1)/2)
∑ (n-k-1)Ck
k=0
where nCk is the combinations of n things k at a time
or
((1+√5)^n - (1-√5)^n)/(2^n √5)
floor((n-1)/2)
∑ (n-k-1)Ck
k=0
where nCk is the combinations of n things k at a time
or
((1+√5)^n - (1-√5)^n)/(2^n √5)
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.