From: Claudia (for Teacher2Teacher Service)
Date: May 07, 1999 at 20:10:16
Subject: Re: Seventh Grade Algebra

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
Ask Teacher2Teacher a new question