Use of Computer Algebra Systems in Finding of a Formula for the 𝒏 Term of a Recurrent Sequence

Abstract

Solving the problem of finding a formula for the n term of a recurrent sequence with a linear dependence requires a series of calculations. We have written a sequence of commands in Maple that make all the necessary calculations. This helps students concentrate on methods of finding the general formula instead of algebraic calculations. Also, students can use Maple to check the completed calculations at each stage. Students can try to compose more difficult problems with linear connection between 4 and more consecutive terms of the recurrent sequence.