论文部分内容阅读
一般地,若数列{an}的连续若干项之间满足递推关系an=f(an-1,an-2,…,an+k)由这个递推关系及K个初始值确定的数列,叫做递推数列。递推数列的重点、难点问题是求通项。求递推数列通项的方法较多、也比较灵活。基本方法:如迭加法,迭乘法,转化为等差、等比数列求通项法,归纳——猜想——证明法等,其中主要的思路是通过转化为等差数列或等比数列来解决问题。
In general, if a sequence of recursions such as an = f (an-1, an-2, ..., an + k) satisfying this recursion relation and K initial values is satisfied between consecutive items of the sequence {an} Called recursion sequence. Recursive sequence of the key, difficult problem is to seek items. Seeking recursive sequence more general methods, but also more flexible. Basic methods: such as the superposition method, the Diego multiplication method, conversion to an equal difference, the geometric series, the generalization-conjecture-proof method, the main idea of which is converted to an arithmetic progression or a series of equal numbers problem.