# Recurrence relation

__: Pattern defining an infinite sequence of numbers__

**Short description**In mathematics, a **recurrence relation** is an equation according to which the [math]\displaystyle{ n }[/math]th term of a sequence of numbers is equal to some combination of the previous terms. Often, only [math]\displaystyle{ k }[/math] previous terms of the sequence appear in the equation, for a parameter [math]\displaystyle{ k }[/math] that is independent of [math]\displaystyle{ n }[/math]; this number [math]\displaystyle{ k }[/math] is called the *order* of the relation. If the values of the first [math]\displaystyle{ k }[/math] numbers in the sequence have been given, the rest of the sequence can be calculated by repeatedly applying the equation.

In *linear recurrences*, the nth term is equated to a linear function of the [math]\displaystyle{ k }[/math] previous terms. A famous example is the recurrence for the Fibonacci numbers,
[math]\displaystyle{ F_n=F_{n-1}+F_{n-2} }[/math]
where the order [math]\displaystyle{ k }[/math] is two and the linear function merely adds the two previous terms. This example is a linear recurrence with constant coefficients, because the coefficients of the linear function (1 and 1) are constants that do not depend on [math]\displaystyle{ n }[/math]. For these recurrences, one can express the general term of the sequence as a closed-form expression of [math]\displaystyle{ n }[/math]. As well, linear recurrences with polynomial coefficients depending on [math]\displaystyle{ n }[/math] are also important, because many common elementary and special functions have a Taylor series whose coefficients satisfy such a recurrence relation (see holonomic function).

Solving a recurrence relation means obtaining a closed-form solution: a non-recursive function of [math]\displaystyle{ n }[/math].

The concept of a recurrence relation can be extended to multidimensional arrays, that is, indexed families that are indexed by tuples of natural numbers.

## Definition

A *recurrence relation* is an equation that expresses each element of a sequence as a function of the preceding ones. More precisely, in the case where only the immediately preceding element is involved, a recurrence relation has the form

- [math]\displaystyle{ u_n=\varphi(n, u_{n-1})\quad\text{for}\quad n\gt 0, }[/math]

where

- [math]\displaystyle{ \varphi:\mathbb N\times X \to X }[/math]

is a function, where X is a set to which the elements of a sequence must belong. For any [math]\displaystyle{ u_0\in X }[/math], this defines a unique sequence with [math]\displaystyle{ u_0 }[/math] as its first element, called the *initial value*.^{[1]}

It is easy to modify the definition for getting sequences starting from the term of index 1 or higher.

This defines recurrence relation of *first order*. A recurrence relation of *order* k has the form

- [math]\displaystyle{ u_n=\varphi(n, u_{n-1}, u_{n-2}, \ldots, u_{n-k})\quad\text{for}\quad n\ge k, }[/math]

where [math]\displaystyle{ \varphi: \mathbb N\times X^k \to X }[/math] is a function that involves k consecutive elements of the sequence. In this case, k initial values are needed for defining a sequence.

## Examples

### Factorial

The factorial is defined by the recurrence relation

- [math]\displaystyle{ n!=n(n-1)!\quad\text{for}\quad n\gt 0, }[/math]

and the initial condition

- [math]\displaystyle{ 0!=1. }[/math]

This is an example of a *linear recurrence with polynomial coefficients* of order 1, with the simple polynomial

- [math]\displaystyle{ f(n)=n }[/math]

as its only coefficient.

### Logistic map

An example of a recurrence relation is the logistic map:

- [math]\displaystyle{ x_{n+1} = r x_n (1 - x_n), }[/math]

with a given constant [math]\displaystyle{ r }[/math]; given the initial term [math]\displaystyle{ x_0 }[/math] each subsequent term is determined by this relation.

### Fibonacci numbers

The recurrence of order two satisfied by the Fibonacci numbers is the canonical example of a homogeneous linear recurrence relation with constant coefficients (see below). The Fibonacci sequence is defined using the recurrence

- [math]\displaystyle{ F_n = F_{n-1}+F_{n-2} }[/math]

with initial conditions

- [math]\displaystyle{ F_0 = 0 }[/math]
- [math]\displaystyle{ F_1 = 1. }[/math]

Explicitly, the recurrence yields the equations

- [math]\displaystyle{ F_2 = F_1 + F_0 }[/math]
- [math]\displaystyle{ F_3 = F_2 + F_1 }[/math]
- [math]\displaystyle{ F_4 = F_3 + F_2 }[/math]

etc.

We obtain the sequence of Fibonacci numbers, which begins

- 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

The recurrence can be solved by methods described below yielding Binet's formula, which involves powers of the two roots of the characteristic polynomial [math]\displaystyle{ t^2 = t + 1 }[/math]; the generating function of the sequence is the rational function

- [math]\displaystyle{ \frac{t}{1-t-t^2}. }[/math]

### Binomial coefficients

A simple example of a multidimensional recurrence relation is given by the binomial coefficients [math]\displaystyle{ \tbinom{n}{k} }[/math], which count the ways of selecting [math]\displaystyle{ k }[/math] elements out of a set of [math]\displaystyle{ n }[/math] elements. They can be computed by the recurrence relation

- [math]\displaystyle{ \binom{n}{k}=\binom{n-1}{k-1}+\binom{n-1}{k}, }[/math]

with the base cases [math]\displaystyle{ \tbinom{n}{0}=\tbinom{n}{n}=1 }[/math]. Using this formula to compute the values of all binomial coefficients generates an infinite array called Pascal's triangle. The same values can also be computed directly by a different formula that is not a recurrence, but uses factorials, multiplication and division, not just additions:

- [math]\displaystyle{ \binom{n}{k}=\frac{n!}{k!(n-k)!}. }[/math]

The binomial coefficients can also be computed with a uni-dimensional recurrence:

- [math]\displaystyle{ \binom n k = \binom n{k-1}(n-k+1)/k, }[/math]

with the initial value [math]\displaystyle{ \binom n 0 =1 }[/math] (The division is not displayed as a fraction for emphasizing that it must be computed after the multiplication, for not introducing fractional numbers). This recurrence is widely used in computers because it does not require to build a table as does the bi-dimensional recurrence, and does involve very large integers as does the formula with factorials (if one uses [math]\displaystyle{ \binom nk= \binom n{n-k}, }[/math] all involved integers are smaller than the final result).

## Difference operator and difference equations

The **difference operator** is an operator that maps sequences to sequences, and, more generally, functions to functions. It is commonly denoted [math]\displaystyle{ \Delta, }[/math] and is defined, in functional notation, as

- [math]\displaystyle{ (\Delta f)(x)=f(x+1)-f(x). }[/math]

It is thus a special case of finite difference.

When using the index notation for sequences, the definition becomes

- [math]\displaystyle{ (\Delta a)_n= a_{n+1} - a_n. }[/math]

The parentheses around [math]\displaystyle{ \Delta f }[/math] and [math]\displaystyle{ \Delta a }[/math] are generally omitted, and [math]\displaystyle{ \Delta a_n }[/math] must be understood as the term of index n in the sequence [math]\displaystyle{ \Delta a, }[/math] and not [math]\displaystyle{ \Delta }[/math] applied to the element [math]\displaystyle{ a_n. }[/math]

Given sequence [math]\displaystyle{ a=(a_n)_{n\in \N}, }[/math] the **first difference** of a is [math]\displaystyle{ \Delta a. }[/math]

The **second difference** is
[math]\displaystyle{ \Delta^2 a=(\Delta\circ\Delta)a= \Delta(\Delta a). }[/math] A simple computation shows that

- [math]\displaystyle{ \Delta^2 a_n= a_{n+2} - 2a_{n+1} + a_n. }[/math]

More generally: the k*th difference* is defined recursively as [math]\displaystyle{ \Delta^k=\Delta\circ \Delta^{k-1}, }[/math] and one has

- [math]\displaystyle{ \Delta^k a_n = \sum_{t=0}^k (-1)^t \binom{k}{t} a_{n+k-t}. }[/math]

This relation can be inverted, giving

- [math]\displaystyle{ a_{n+k} = a_n + {k\choose 1} \Delta a_n + \cdots + {k\choose k} \Delta^k(a_n). }[/math]

A **difference equation** of order k is an equation that involves the k first differences of a sequence or a function, in the same way as a differential equation of order k relates the k first derivatives of a function.

The two above relations allow transforming a recurrence relation of order k into a difference equation of order k, and, conversely, a difference equation of order k into recurrence relation of order k. Each transformation is the inverse of the other, and the sequences that are solution of the difference equation are exactly those that satisfies the recurrence relation.

For example, the difference equation

- [math]\displaystyle{ 3\Delta^2 a_n + 2\Delta a_n + 7a_n = 0 }[/math]

is equivalent to the recurrence relation

- [math]\displaystyle{ 3a_{n+2} = 4a_{n+1} - 8a_n, }[/math]

in the sense that the two equations are satisfied by the same sequences.

As it is equivalent for a sequence to satisfy a recurrence relation or to be the solution of a difference equation, the two terms "recurrence relation" and "difference equation" are sometimes used interchangeably. See Rational difference equation and Matrix difference equation for example of uses of "difference equation" instead of "recurrence relation"

Difference equations resemble to differential equations, and this resemblance is often used to mimic methods for solving differentiable equations to apply to solving difference equations, and therefore recurrence relations.

Summation equations relate to difference equations as integral equations relate to differential equations. See time scale calculus for a unification of the theory of difference equations with that of differential equations.

### From sequences to grids

Single-variable or one-dimensional recurrence relations are about sequences (i.e. functions defined on one-dimensional grids). Multi-variable or n-dimensional recurrence relations are about [math]\displaystyle{ n }[/math]-dimensional grids. Functions defined on [math]\displaystyle{ n }[/math]-grids can also be studied with **partial difference equations**.^{[2]}

## Solving

### Solving linear recurrence relations with constant coefficients

### Solving first-order non-homogeneous recurrence relations with variable coefficients

Moreover, for the general first-order non-homogeneous linear recurrence relation with variable coefficients:

- [math]\displaystyle{ a_{n+1} = f_n a_n + g_n, \qquad f_n \neq 0, }[/math]

there is also a nice method to solve it:^{[3]}

- [math]\displaystyle{ a_{n+1} - f_n a_n = g_n }[/math]
- [math]\displaystyle{ \frac{a_{n+1}}{\prod_{k=0}^n f_k} - \frac{f_n a_n}{\prod_{k=0}^n f_k} = \frac{g_n}{\prod_{k=0}^n f_k} }[/math]

- [math]\displaystyle{ \frac{a_{n+1}}{\prod_{k=0}^n f_k} - \frac{a_n}{\prod_{k=0}^{n-1} f_k} = \frac{g_n}{\prod_{k=0}^n f_k} }[/math]

Let

- [math]\displaystyle{ A_n = \frac{a_n}{\prod_{k=0}^{n-1} f_k}, }[/math]

Then

- [math]\displaystyle{ A_{n+1} - A_n = \frac{g_n}{\prod_{k=0}^n f_k} }[/math]
- [math]\displaystyle{ \sum_{m=0}^{n-1}(A_{m+1} - A_m) = A_n - A_0 = \sum_{m=0}^{n-1}\frac{g_m}{\prod_{k=0}^m f_k} }[/math]
- [math]\displaystyle{ \frac{a_n}{\prod_{k=0}^{n-1} f_k} = A_0 + \sum_{m=0}^{n-1}\frac{g_m}{\prod_{k=0}^m f_k} }[/math]
- [math]\displaystyle{ a_n = \left(\prod_{k=0}^{n-1} f_k \right) \left(A_0 + \sum_{m=0}^{n-1}\frac{g_m}{\prod_{k=0}^m f_k}\right) }[/math]

If we apply the formula to [math]\displaystyle{ a_{n+1} = (1 + h f_{nh}) a_n + hg_{nh} }[/math] and take the limit [math]\displaystyle{ h \to 0 }[/math], we get the formula for first order linear differential equations with variable coefficients; the sum becomes an integral, and the product becomes the exponential function of an integral.

### Solving general homogeneous linear recurrence relations

Many homogeneous linear recurrence relations may be solved by means of the generalized hypergeometric series. Special cases of these lead to recurrence relations for the orthogonal polynomials, and many special functions. For example, the solution to

- [math]\displaystyle{ J_{n+1}=\frac{2n}{z}J_n-J_{n-1} }[/math]

is given by

- [math]\displaystyle{ J_n=J_n(z), }[/math]

the Bessel function, while

- [math]\displaystyle{ (b-n)M_{n-1} +(2n-b+z)M_n - nM_{n+1}=0 }[/math]

is solved by

- [math]\displaystyle{ M_n=M(n,b;z) }[/math]

the confluent hypergeometric series. Sequences which are the solutions of linear difference equations with polynomial coefficients are called P-recursive. For these specific recurrence equations algorithms are known which find polynomial, rational or hypergeometric solutions.

### Solving first-order rational difference equations

A first order rational difference equation has the form [math]\displaystyle{ w_{t+1} = \tfrac{aw_t+b}{cw_t+d} }[/math]. Such an equation can be solved by writing [math]\displaystyle{ w_t }[/math] as a nonlinear transformation of another variable [math]\displaystyle{ x_t }[/math] which itself evolves linearly. Then standard methods can be used to solve the linear difference equation in [math]\displaystyle{ x_t }[/math].

## Stability

### Stability of linear higher-order recurrences

The linear recurrence of order [math]\displaystyle{ d }[/math],

- [math]\displaystyle{ a_n = c_1a_{n-1} + c_2a_{n-2}+\cdots+c_da_{n-d}, }[/math]

has the characteristic equation

- [math]\displaystyle{ \lambda^d - c_1 \lambda^{d-1} - c_2 \lambda^{d-2} - \cdots - c_d \lambda^0 =0. }[/math]

The recurrence is stable, meaning that the iterates converge asymptotically to a fixed value, if and only if the eigenvalues (i.e., the roots of the characteristic equation), whether real or complex, are all less than unity in absolute value.

### Stability of linear first-order matrix recurrences

In the first-order matrix difference equation

- [math]\displaystyle{ [x_t - x^*] = A[x_{t-1}-x^*] }[/math]

with state vector [math]\displaystyle{ x }[/math] and transition matrix [math]\displaystyle{ A }[/math], [math]\displaystyle{ x }[/math] converges asymptotically to the steady state vector [math]\displaystyle{ x^* }[/math] if and only if all eigenvalues of the transition matrix [math]\displaystyle{ A }[/math] (whether real or complex) have an absolute value which is less than 1.

### Stability of nonlinear first-order recurrences

Consider the nonlinear first-order recurrence

- [math]\displaystyle{ x_n=f(x_{n-1}). }[/math]

This recurrence is locally stable, meaning that it converges to a fixed point [math]\displaystyle{ x^* }[/math] from points sufficiently close to [math]\displaystyle{ x^* }[/math], if the slope of [math]\displaystyle{ f }[/math] in the neighborhood of [math]\displaystyle{ x^* }[/math] is smaller than unity in absolute value: that is,

- [math]\displaystyle{ | f' (x^*) | \lt 1. }[/math]

A nonlinear recurrence could have multiple fixed points, in which case some fixed points may be locally stable and others locally unstable; for continuous *f* two adjacent fixed points cannot both be locally stable.

A nonlinear recurrence relation could also have a cycle of period [math]\displaystyle{ k }[/math] for [math]\displaystyle{ k \gt 1 }[/math]. Such a cycle is stable, meaning that it attracts a set of initial conditions of positive measure, if the composite function

- [math]\displaystyle{ g(x) := f \circ f \circ \cdots \circ f(x) }[/math]

with [math]\displaystyle{ f }[/math] appearing [math]\displaystyle{ k }[/math] times is locally stable according to the same criterion:

- [math]\displaystyle{ | g' (x^*) | \lt 1, }[/math]

where [math]\displaystyle{ x^* }[/math] is any point on the cycle.

In a chaotic recurrence relation, the variable [math]\displaystyle{ x }[/math] stays in a bounded region but never converges to a fixed point or an attracting cycle; any fixed points or cycles of the equation are unstable. See also logistic map, dyadic transformation, and tent map.

## Relationship to differential equations

When solving an ordinary differential equation numerically, one typically encounters a recurrence relation. For example, when solving the initial value problem

- [math]\displaystyle{ y'(t) = f(t,y(t)), \ \ y(t_0)=y_0, }[/math]

with Euler's method and a step size [math]\displaystyle{ h }[/math], one calculates the values

- [math]\displaystyle{ y_0=y(t_0), \ \ y_1=y(t_0+h), \ \ y_2=y(t_0+2h), \ \dots }[/math]

by the recurrence

- [math]\displaystyle{ \, y_{n+1} = y_n + hf(t_n,y_n), t_n = t_0 + nh }[/math]

Systems of linear first order differential equations can be discretized exactly analytically using the methods shown in the discretization article.

## Applications

### Mathematical biology

Some of the best-known difference equations have their origins in the attempt to model population dynamics. For example, the Fibonacci numbers were once used as a model for the growth of a rabbit population.

The logistic map is used either directly to model population growth, or as a starting point for more detailed models of population dynamics. In this context, coupled difference equations are often used to model the interaction of two or more populations. For example, the Nicholson–Bailey model for a host-parasite interaction is given by

- [math]\displaystyle{ N_{t+1} = \lambda N_t e^{-aP_t} }[/math]
- [math]\displaystyle{ P_{t+1} = N_t(1-e^{-aP_t}), }[/math]

with [math]\displaystyle{ N_t }[/math] representing the hosts, and [math]\displaystyle{ P_t }[/math] the parasites, at time [math]\displaystyle{ t }[/math].

Integrodifference equations are a form of recurrence relation important to spatial ecology. These and other difference equations are particularly suited to modeling univoltine populations.

### Computer science

Recurrence relations are also of fundamental importance in analysis of algorithms.^{[4]}^{[5]} If an algorithm is designed so that it will break a problem into smaller subproblems (divide and conquer), its running time is described by a recurrence relation.

A simple example is the time an algorithm takes to find an element in an ordered vector with [math]\displaystyle{ n }[/math] elements, in the worst case.

A naive algorithm will search from left to right, one element at a time. The worst possible scenario is when the required element is the last, so the number of comparisons is [math]\displaystyle{ n }[/math].

A better algorithm is called binary search. However, it requires a sorted vector. It will first check if the element is at the middle of the vector. If not, then it will check if the middle element is greater or lesser than the sought element. At this point, half of the vector can be discarded, and the algorithm can be run again on the other half. The number of comparisons will be given by

- [math]\displaystyle{ c_1=1 }[/math]
- [math]\displaystyle{ c_n=1+c_{n/2} }[/math]

the time complexity of which will be [math]\displaystyle{ O(\log_2(n)) }[/math].

### Digital signal processing

In digital signal processing, recurrence relations can model feedback in a system, where outputs at one time become inputs for future time. They thus arise in infinite impulse response (IIR) digital filters.

For example, the equation for a "feedforward" IIR comb filter of delay [math]\displaystyle{ T }[/math] is:

- [math]\displaystyle{ y_t = (1 - \alpha) x_t + \alpha y_{t - T}, }[/math]

where [math]\displaystyle{ x_t }[/math] is the input at time [math]\displaystyle{ t }[/math], [math]\displaystyle{ y_t }[/math] is the output at time [math]\displaystyle{ t }[/math], and [math]\displaystyle{ \alpha }[/math] controls how much of the delayed signal is fed back into the output. From this we can see that

- [math]\displaystyle{ y_t = (1 - \alpha) x_t + \alpha ((1-\alpha) x_{t-T} + \alpha y_{t - 2T}) }[/math]
- [math]\displaystyle{ y_t = (1 - \alpha) x_t + (\alpha-\alpha^2) x_{t-T} + \alpha^2 y_{t - 2T} }[/math]

etc.

### Economics

Recurrence relations, especially linear recurrence relations, are used extensively in both theoretical and empirical economics.^{[6]}^{[7]} In particular, in macroeconomics one might develop a model of various broad sectors of the economy (the financial sector, the goods sector, the labor market, etc.) in which some agents' actions depend on lagged variables. The model would then be solved for current values of key variables (interest rate, real GDP, etc.) in terms of past and current values of other variables.

## See also

- Holonomic sequences
- Iterated function
- Orthogonal polynomials
- Recursion
- Recursion (computer science)
- Lagged Fibonacci generator
- Master theorem (analysis of algorithms)
- Circle points segments proof
- Continued fraction
- Time scale calculus
- Combinatorial principles
- Infinite impulse response
- Integration by reduction formulae
- Mathematical induction

## References

### Footnotes

- ↑ Jacobson, Nathan , Basic Algebra 2 (2nd ed.), § 0.4. pg 16.
- ↑ Partial difference equations, Sui Sun Cheng, CRC Press, 2003, ISBN 978-0-415-29884-1
- ↑ "Archived copy". http://faculty.pccu.edu.tw/%7Emeng/Math15.pdf.
- ↑ Cormen, T. et al,
*Introduction to Algorithms*, MIT Press, 2009 - ↑ R. Sedgewick, F. Flajolet,
*An Introduction to the Analysis of Algorithms*, Addison-Wesley, 2013 - ↑ Stokey, Nancy L.; Lucas, Robert E. Jr.; Prescott, Edward C. (1989).
*Recursive Methods in Economic Dynamics*. Cambridge: Harvard University Press. ISBN 0-674-75096-9. https://books.google.com/books?id=BgQ3AwAAQBAJ. - ↑ Ljungqvist, Lars; Sargent, Thomas J. (2004).
*Recursive Macroeconomic Theory*(Second ed.). Cambridge: MIT Press. ISBN 0-262-12274-X. https://archive.org/details/recursivemacroec02edljun.

### Bibliography

- Batchelder, Paul M. (1967).
*An introduction to linear difference equations*. Dover Publications. - Miller, Kenneth S. (1968).
*Linear difference equations*. W. A. Benjamin. - Fillmore, Jay P.; Marx, Morris L. (1968). "Linear recursive sequences".
*SIAM Rev.***10**(3): pp. 324–353. - Brousseau, Alfred (1971).
*Linear Recursion and Fibonacci Sequences*. Fibonacci Association. http://www.fq.math.ca/linear.html. - Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
*Introduction to Algorithms*, Second Edition. MIT Press and McGraw-Hill, 1990. ISBN 0-262-03293-7. Chapter 4: Recurrences, pp. 62–90. - Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren (1994).
*Concrete Mathematics: A Foundation for Computer Science*(2 ed.). Addison-Wesley. ISBN 0-201-55802-5. - Enders, Walter (2010).
*Applied Econometric Times Series*(3 ed.). http://eu.wiley.com/WileyCDA/WileyTitle/productCd-EHEP000338.html. - Cull, Paul; Flahive, Mary; Robson, Robbie (2005).
*Difference Equations: From Rabbits to Chaos*. Springer. ISBN 0-387-23234-6. chapter 7. - Jacques, Ian (2006).
*Mathematics for Economics and Business*(Fifth ed.). Prentice Hall. pp. 551–568. ISBN 0-273-70195-9. https://archive.org/details/mathematicsforec00jacq. Chapter 9.1: Difference Equations. - Minh, Tang; Van To, Tan (2006). "Using generating functions to solve linear inhomogeneous recurrence equations".
*Proc. Int. Conf. Simulation, Modelling and Optimization, SMO'06*. pp. 399–404. http://www.wseas.us/e-library/conferences/2006lisbon/papers/517-481.pdf. - Polyanin, Andrei D.. "Difference and Functional Equations: Exact Solutions". http://eqworld.ipmnet.ru/en/solutions/fe.htm. at EqWorld - The World of Mathematical Equations.
- Polyanin, Andrei D.. "Difference and Functional Equations: Methods". http://eqworld.ipmnet.ru/en/education/edu-fe.htm. at EqWorld - The World of Mathematical Equations.
- Wang, Xiang-Sheng; Wong, Roderick (2012). "Asymptotics of orthogonal polynomials via recurrence relations".
*Anal. Appl.***10**(2): 215–235. doi:10.1142/S0219530512500108.

## External links

- Hazewinkel, Michiel, ed. (2001), "Recurrence relation",
*Encyclopedia of Mathematics*, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=p/r080150 - Weisstein, Eric W.. "Recurrence Equation". http://mathworld.wolfram.com/RecurrenceEquation.html.
- "OEIS Index Rec". http://oeis.org/wiki/Index_to_OEIS:_Section_Rec. OEIS index to a few thousand examples of linear recurrences, sorted by order (number of terms) and signature (vector of values of the constant coefficients)

Original source: https://en.wikipedia.org/wiki/Recurrence relation.
Read more |