
related topics 
{math, number, function} 
{specie, animal, plant} 
{household, population, female} 
{math, energy, light} 

In mathematics, a recurrence relation is an equation that recursively defines a sequence: each term of the sequence is defined as a function of the preceding terms.
The term difference equation sometimes (and for the purposes of this article) refers to a specific type of recurrence relation. Note however that "difference equation" is frequently used to refer to any recurrence relation.
An example of a recurrence relation is the logistic map:
Some simply defined recurrence relations can have very complex (chaotic) behaviours, and they are a part of the field of mathematics known as nonlinear analysis.
Solving a recurrence relation means obtaining a closedform solution: a nonrecursive function of n.
Contents
Full article ▸


related documents 
Binary search tree 
Elliptic curve cryptography 
Collatz conjecture 
Topological space 
LR parser 
Computational complexity theory 
Limit (category theory) 
Markov chain 
Zermeloâ€“Fraenkel set theory 
Matrix multiplication 
Hash table 
Peano axioms 
Limit superior and limit inferior 
Calculus 
Naive set theory 
Inverse function 
Numeral system 
Finite field 
Recursion 
Word problem for groups 
Cantor set 
Fourier series 
Kolmogorov complexity 
Scheme (programming language) 
Inner product space 
Functional programming 
Pi 
Axiom 
Addition 
Pythagorean theorem 
