A new method for solving the linear recurrence relation with nonhomogeneous constant coefficients in some cases

Abstract

Recursive relation mainly describes the unique law satisfied by a sequence, so it plays an important role in almost all branches of mathematics. It is also one of the main algorithms commonly used in computer programming. This paper first introduces the concept of recursive relation and two common basic forms, then starts with the solution of linear recursive relation with non-homogeneous constant coefficients, gives a new solution idea, and gives a general proof. Finally, through an example, the general method and the new method given in this paper are compared and verified.