What is a recurrence relation?
A recurrence relation is a mathematical equation that defines each term of a sequence as a combination of previous terms. Given the initial values for the first few terms, the rest of the sequence can be calculated by repeatedly applying the equation. Solving a recurrence relation means finding a non-recursive, closed-form function of n.
What we know
- A recurrence relation defines the nth term of a sequence as some combination of previous terms. [1, 2]
- The number k of previous terms that appear in the equation is called the order of the relation. [2]
- Sequences satisfying a recurrence relation are exactly the same as those satisfying a difference equation. [2]
- Solving a recurrence relation involves obtaining a closed-form solution, which is a non-recursive function of n. [2]
Where to go next
- a case in pointHow do Fibonacci numbers use recurrence?
- how it workedWhat is a three-term recurrence relation?
- compared withHow do difference equations relate to recurrences?
- the bigger pictureWhat is discrete mathematics?
- whoWho discovered Somos sequences?
- an unexpected connectionWhy do division-based sequences yield integers?Although Somos sequences are defined by a recurrence involving division where one would expect fractions, remarkably, some of these sequences consist entirely of integers.
Sources
- [1]recurrence relation (Wikidata Q740970) · CC0 1.0
- [2]Recurrence relation · CC BY-SA 4.0
- [3]Three-term recurrence relation · CC BY-SA 4.0
- [4]Discrete mathematics · CC BY-SA 4.0
- [5]Somos sequence · CC BY-SA 4.0
Your path
- Who were the major playwrights of Old Comedy in ancient Athens?
- What is a recurrence relation?