Navigation Home Search Site map
Contact Graeme Home Email Twitter
Math Help > Sequences and Series > Recurrence Relations
A recurrence relation is a way of expressing an element of a sequence a_{n} in terms of "previous" elements a_{i}, where i < n.
Here's what you'll find in this section:
Linear Recurrence Relation -- one in which a_{n+1} is a constant times a_{n} plus another constant -- a method for finding a closed form.
Fibonacci Numbers -- whose successive ratios approach the Golden Ratio
Golden Ratio -- (sqrt(5)+1)/2, a special number that comes up in a variety of geometrical contexts
Recurrence Cycle -- recurrence relations whose elements repeat in a cycle
Recurrence Relation of Successive Powers of Polynomial Root -- what a mouthful! The gist of this topic is that the successive powers of a root of a polynomial form a sequence that has an simple recurrence relation.
Mathworld - Recurrence Relation
Generating Function Formal Power Series
Generating Function
The webmaster and author of this Math Help site is Graeme McRae.