论文部分内容阅读
数学教学中经常有求递推数列的通项公式问题,这是高考中的一个热点问题(如2006年文理科共34套试卷中涉及递推数列解答题的有29套),而递推数列问题正是教学中的一个难点.求递推数列的通项公式方法很多,如叠加法、累乘法、迭代法、待定系数法、不动点法、特征方程法,数学归纳法等,不同的类型有不同的方法.高考题中出现很多型如an+1=f(n)·an+g(n)(n∈N*)的问题,
In mathematics teaching, there is often a general formula for recursive series, which is a hot issue in the college entrance examination (for example, there are 29 sets of recursive series of questions in the 34 papers of the Arts and Sciences Department in 2006), while the recursive series The problem is one of the difficulties in teaching. There are many ways to solve the general formula of recursion series, such as superposition method, cumulative multiplication method, iterative method, undetermined coefficient method, fixed point method, characteristic equation method, mathematical induction method, etc. There are different types of methods. There are many types of questions in the college entrance exam such as an+1=f(n)·an+g(n)(n∈N*).