Difference between revisions of "Recursion"

m (typo)
(linked induction)
Line 10: Line 10:
 
* [[Combinatorics]]
 
* [[Combinatorics]]
 
* [[Sequence]]
 
* [[Sequence]]
 +
* [[Induction]]

Revision as of 16:35, 19 June 2006

Recursion is defining something in terms of a previous term, function, etc. For example, the famous Fibonacci sequence is defined recursively. If we let $F_n$ be the nth term, the sequence is: $\displaystyle F_0=1, F_1=1, F_2=2, F_3=3, F_4=5, F_5=8$, and so on. A recursive definition is: $F_{n+1}=F_{n}+F_{n-1}$. That is a symbolic way to say "The next term is the sum of the two previous terms".

Examples

See also