Difference between revisions of "Recursion"
(Tag: Undo) |
Michael1129 (talk | contribs) (→Examples) |
||
Line 14: | Line 14: | ||
* Use of recursion to count a type of number: [[2007_AMC_12A_Problems#Problem_25| 2007 AMC 12A Problem 25]] | * Use of recursion to count a type of number: [[2007_AMC_12A_Problems#Problem_25| 2007 AMC 12A Problem 25]] | ||
* Yet another use in combinatorics [[2008_AIME_I_Problems#Problem_11| 2008 AIME I Problem 11]] | * Yet another use in combinatorics [[2008_AIME_I_Problems#Problem_11| 2008 AIME I Problem 11]] | ||
+ | * [[2015_AMC_12A_Problems#Problem_22| 2015 AMC 12A Problem 22]] | ||
== See also == | == See also == |
Revision as of 20:21, 28 October 2021
Recursion is a method of defining something (usually a sequence or function) in terms of previously defined values. The most famous example of a recursive definition is that of the Fibonacci sequence. If we let be the
th Fibonacci number, the sequence is defined recursively by the relations
and
. (That is, each term is the sum of the previous two terms.) Then we can easily calculate early values of the sequence in terms of previous values:
, and so on.
Often, it is convenient to convert a recursive definition into a closed-form definition. For instance, the sequence defined recursively by and
for
also has the closed-form definition
.
In computer science, recursion also refers to the technique of having a function repeatedly call itself. The concept is very similar to recursively defined mathematical functions, but can also be used to simplify the implementation of a variety of other computing tasks.
Examples
- Mock AIME 2 2006-2007 Problem 8 (number theory)
- A combinatorical use of recursion: 2006 AIME I Problem 11
- Another combinatorical use of recursion: 2001 AIME I Problem 14
- Use of recursion to compute an explicit formula: 2006 AIME I Problem 13
- Use of recursion to count a type of number: 2007 AMC 12A Problem 25
- Yet another use in combinatorics 2008 AIME I Problem 11
- 2015 AMC 12A Problem 22