finite difference equation | recurrence formula

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form like f(n) - f(n - 1) = g(n), where g is some integer function. The above equation is the discrete analog of the first-order ordinary differential equation f'(x) = g(x). Examples of difference equations often arise in dynamical systems.

argument addition relation | argument multiplication relation | Binet forms | Binet's formula | Clenshaw recurrence formula | difference-differential equation | fast Fibonacci transform | Fibonacci number | finite difference | indicial equation | linear recurrence equation | Lucas sequence | ordinary differential equation | quadratic recurrence equation | quotient-difference table | reflection relation | Skolem-Mahler-Lech theorem | translation relation