一类递推数列的解法及应用

• 作 者: 宋秋瑜
• 机 构: 黑龙江省哈尔滨市第一二二中学,
• 出 处: 理科考试研究
• 发表日期: 2012年03期
• 关键词: 递推数列 解法 推广和应用 通项公式 热点问题 求解方法 转化 高考 常数

求递推数列的通项公式是近年来高考的热点问题.不难发现,这类问题常可转化为一类最基本的递推数列a_(n+1)=pa_n+q(其中常数p、q满足条件p≠1,pq≠0),本文归纳几种求解方法并加以推广和应用.

The general formula for recursive series is a hot issue in the college entrance examination in recent years. It is not difficult to find that such problems can often be converted into the most basic recurrence sequence a_(n+1)=pa_n+q (in which the constant p, q satisfies the condition p≠1, pq≠0). This paper summarizes several solving methods and generalizes and applies them.