论文部分内容阅读
我们知道,递推数列是高考考查数列问题的重要题型,递推数列一般是指,数列的任意项a_n(a_(n-1),a_(n-2))或项数n或数列的前n项和S_n(S_(n-1),S_(n-2))之间的关系体现在一个等式之中.由于数列可以看作是项数n的函数,因此我们常常可以在递推关系式中取n为n-1(或n+1,n+2,n-2等),通过对两个递推式进行有关运算(相减、相除、相等)得到相邻项或其它项之间的某种关系,快速实现解题目标.这种函数观点是解递推型数列问题最基本、最核心的思想方法,必须切实掌握.
We know that the recurrence sequence is an important question for the college entrance examination exam questions. The recurrence sequence generally refers to any of a_n (a_ (n-1), a_ (n-2)) or n The relationship between the first n terms and S_n (S_ (n-1), S_ (n-2)) is shown in an equation. Since the sequence can be seen as a function of the number n, we can often Push n in the relational formula to n-1 (or n + 1, n + 2, n-2, etc.), through the two recursive operations (subtraction, division, equal) Some other relations between the rapid realization of the problem solving objectives.This function view is to solve the problem of pushing the serial number of the most basic and core ideological methods, we must effectively grasp.