Recurrence relation

Combinatorics

Published in Erchin Serpedin, Thomas Chen, Dinesh Rajan, Mathematical Foundations for SIGNAL PROCESSING, COMMUNICATIONS, AND NETWORKING, 2012

Walter D. Wallis

A recurrence relation is said to be linear if the value for an is given as a finite sum, each summand of which is a multiple of the first power of some previous term, or a constant or function of n; so, for example, an = nan−1 + 2n is linear, and an = (an−1)2 − 2n is nonlinear.

Using a universal combinatorial problem to teach higher-order linear recurrence relations

View Article

Journal Information

Published in International Journal of Mathematical Education in Science and Technology, 2022

Ravil Nigmatulin, Mariya Vaguina

When teaching students, problems should not be solved in general terms. Rather, they should be solved with specific numerical values, as we have mentioned in this paper. This approach will develop the skills of students in constructing recurrence relations, calculating initial conditions, finding the roots of characteristic equations, correctly constructing general solutions, and finding solutions to a problem through initial conditions.

Recurrence relation

Explore chapters and articles related to this topic

Combinatorics

Using a universal combinatorial problem to teach higher-order linear recurrence relations