RecurrenceTable[eqns, expr, {n, n_max}] generates a list of values of expr for successive n based on solving the recurrence equations eqns. RecurrenceTable[eqns, expr, nspec] ...

The symbolic character of Mathematica makes possible a uniquely coherent approach to integer sequences, integrating functional forms, equations, generating functions, and ...

Mathematica has a wide coverage of named functions defined by sums and recurrence relations. Often using original algorithms developed at Wolfram Research, Mathematica ...

RecurrenceFilter[{\[Alpha], \[Beta]}, x] filters x using a linear recurrence equation with coefficients \[Alpha] and \[Beta]. RecurrenceFilter[tf, x] uses a discrete-time ...

In calculus even more than other areas, Mathematica packs centuries of mathematical development into a small number of exceptionally powerful functions. Continually enhanced ...

With origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. ...

Built into Mathematica is the world's largest collection of both numerical and symbolic equation solving capabilities—with many original algorithms, all automatically ...

Mathematica has been used to make many important discoveries in discrete mathematics over the past two decades. Its integration of highly efficient and often original ...

LinearRecurrence[ker, init, n] gives the sequence of length n obtained by iterating the linear recurrence with kernel ker starting with initial values init. ...

Mathematica provides a comprehensive set of methods for designing digital filters. Digital filter design methods. This method obtains a finite impulse response (FIR) from a ...