由递推关系式确定数列的阶

Determining the Order of Recursive Sequence

在一些由递推关系式所决定的数列中,通常需要对数列的阶进行估计。由于数列的显式表达式一般很难求出,因此要判定它们的阶并不是一件容易的事。本文对两种不同类型的递推关系式采用不同的方法得到数列极限的细致刻画。

The order of the recursive sequence determined by recursion formula is often needed to be estimated. It is not easy to determine the order of the sequence because it is difficult to find the expression of the sequence. This paper presents a detailed description of two different types of recursive relations in different ways. The method is simple and easy to understand.