RSolveValue
RSolveValue[eqn,expr,n]
gives the value of expr determined by a symbolic solution to the ordinary difference equation eqn with independent variable n.
RSolveValue[{eqn_{1},eqn_{2},…},expr,…]
uses a symbolic solution for a list of difference equations.
RSolveValue[eqn,expr,{n_{1},n_{2},…}]
uses a solution for the partial recurrence equation eqn.
Details and Options
 RSolveValue[eqn,a,n] gives a solution for a as a pure function.
 The equations can involve objects of the form a[n+λ], where λ is a constant, or in general, objects of the form a[ψ[n]], a[ψ[ψ[n]], a[ψ[…[ψ[n]]…]], where ψ can have forms such as:

n+λ arithmetic difference equation μ n geometric or difference equation μ n+λ arithmeticgeometric functional difference equation μ n^{α} geometricpower functional difference equation linear fractional functional difference equation  Equations such as a[0]==val can be given to specify end conditions.
 If not enough end conditions are specified, RSolveValue will use general solutions in which undetermined constants are introduced.
 The constants introduced by RSolveValue are indexed by successive integers. The option GeneratedParameters specifies the function to apply to each index. The default is GeneratedParameters>C, which yields constants C[1], C[2], ….
 GeneratedParameters>(Module[{C},C]&) guarantees that the constants of integration are unique, even across different invocations of RSolveValue.
 For partial recurrence equations, RSolveValue generates arbitrary functions C[n][…].
 Solutions given by RSolveValue sometimes include sums that cannot be carried out explicitly by Sum. Dummy variables with local names are used in such sums.
 RSolveValue[eqn,a[Infinity],n] gives the limiting value of the solution a at Infinity.
 RSolveValue handles both ordinary difference equations and ‐difference equations.
 RSolveValue handles difference‐algebraic equations, as well as ordinary difference equations.
 RSolveValue can solve linear recurrence equations of any order with constant coefficients. It can also solve many linear equations up to second order with nonconstant coefficients, as well as many nonlinear equations.
Examples
open allclose allBasic Examples (4)
Scope (43)
Basic Uses (9)
Compute the general solution of a firstorder difference equation:
Obtain a particular solution by adding an initial condition:
Plot the solution of a firstorder difference equation:
Verify the solution of a difference equation by using a in the second argument:
Obtain the general solution of a higherorder difference equation:
Solve a system of difference equations:
Compute the value of the solution at a point:
Compute the limiting value of the solution at Infinity:
Solve a partial difference equation:
Use different names for the arbitrary constants in the general solution:
Linear Difference Equations (6)
Nonlinear Difference Equations (5)
Systems of Difference Equations (5)
Partial Difference Equations (3)
Q–Difference Equations (6)
Functional Difference Equations (4)
Limits of Recursive Sequences (5)
Compute the limit of a linear recursive sequence:
Visualize the convergence of the sequence to its limiting value:
Compute the limit of a nonlinear recursive sequence:
Visualize the convergence of the sequence to its limiting value:
Compute the limit of a trigonometric recursive sequence:
Visualize the convergence of the sequence to its limiting value:
Compute the limit of a secondorder recursive sequence:
Visualize the convergence of the sequence to its limiting value:
Compute the limit of the ratio of adjacent terms, f[n+1]/f[n], for the Fibonacci sequence, which satisfies the difference equation:
Solve the difference equation to find the ratio:
Compute the limit of the ratio using DiscreteLimit:
Visualize the convergence of the sequence to its limiting value:
Alternatively, compute the limit using DiscreteLimit in RSolveValue itself:
Generalizations & Extensions (2)
Applications (13)
This models the amount a[n] at year n when the interest r is paid on the principal p only:
Here the interest is paid on the current amount a[n], i.e. compound interest:
Here a[n] denotes the number of moves required in the Tower of Hanoi problem with n disks:
Here a[n] is the number of ways to tile an n×3 space with 2×1 tiles:
The number of comparisons for a binary search problem:
Number of arithmetic operations in the fast Fourier transform:
The nested radical satisfies a nonlinear difference equation:
Compute the exact value of the nested radical:
Visualize the convergence of the sequence to the exact value:
The integral satisfies the difference equation:
The integral satisfies the difference equation:
The difference equation for the series coefficients of :
The determinant of an n×n tridiagonal matrix with diagonals c, a, b satisfies:
This models the surface area s[n] in dimension n of a unit sphere:
The volume of the unit ball in dimension n:
Applying Newton's method to , or computing :
Applying the Euler forward method to yields:
Solve the difference equation that describes the complexity of Karatsuba multiplication:
Compare with the complexity of schoolbook multiplication:
Efficiently compute the n term of a linear recurrence for large n:
Properties & Relations (9)
RSolveValue returns an expression for the solution:
RSolve returns a rule for the solution:
Solutions satisfy their difference and boundary equations:
Difference equation corresponding to Sum:
Difference equation corresponding to Product:
RSolveValue finds a symbolic solution for this difference equation:
RecurrenceTable generates a procedural solution for the same problem:
FindLinearRecurrence finds the minimal linear recurrence for a list:
RSolveValue finds the sequence satisfying the recurrence:
LinearRecurrence generates the n term for a linear recurrence:
Obtain the same result using RSolveValue:
Use RecurrenceFilter to filter a signal:
Solve the corresponding difference equation using RSolveValue:
Forecast the next value for a time series based on ARProcess:
Obtain the same result using RSolveValue:
Possible Issues (3)
The solution to this difference equation is unique as a sequence:
As a function it is only unique up to a function of period 1:
RSolveValue returns only a single branch if the solution has multiple branches:
Use RSolve to get all of the solution branches:
Verify the solution when the equation involves subscripted variables: