Definition:Linear Recurrence Relation

This page has been identified as a candidate for refactoring of basic complexity. Until this has been finished, please leave {{Refactor}} in the code. New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code.

Definition

A linear recurrence relation is a recurrence relation which has the form:

$a_n y_{n + k} + a_{n - 1} y_{n + k - 1} + \cdots + a_0 y_k = \map b k$

where $a_0, \ldots, a_n$ are constants.

Homogeneous Linear Recurrence Relation

If in a linear recurrence relation $\map b k = 0$, then the equation is homogeneous.

Otherwise it is inhomogeneous.

Sources

There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page.