Teacher2Teacher |
Q&A #1537 |
View entire discussion [<<prev]
Fibonacci's sequence is usually represented in the recursive form, since it requires the use of the previous numbers to generate the next number. For example: I will designate subscripted numbers in parentheses! a(n) = a(n-1)+a(n-2) that is to say that the third number requires adding the first two 1+1=2 1,1,2,3,5,8.......... -Claudia, for the Teacher2Teacher service
Post a public
discussion message |
[Privacy Policy] [Terms of Use]
Math Forum Home ||
The Math Library ||
Quick Reference ||
Math Forum Search