Recursion: Difference between revisions
m proofreading |
m →See also: fixed link |
||
| Line 7: | Line 7: | ||
=== See also === | === See also === | ||
* [Combinatorics] | * [[Combinatorics]] | ||
* [[Sequence]] | |||
Revision as of 16:06, 19 June 2006
Recursion is defining something in terms of a previous term, function, etc. For example, the famous Fibonacci sequence is defined recusively. If we let 
be the nth term, the sequence is: 
, and so on. A recursive definition is: 
. That is a symbolic way to say "The next term is the sum of the two previous terms".
Examples
- A combinatorical use of recursion: AIME 2006I/11
- Use of recursion to compute an explicit formula: AIME 2006I/13
