| 一类形如an+2=f(n)an+g(n)的二阶递推方程的求解与应用 |
| |
| 引用本文： | 华阳标.一类形如an+2=f(n)an+g(n)的二阶递推方程的求解与应用[J].德州学院学报,2001,17(4):11-15. |
| |
| 作者姓名： | 华阳标 |
| |
| 作者单位： | 赣州市委党校,江西,赣州,341000 |
| |
| 摘 要： | 通过对二阶递推方程αn 2=f(n)αn g(n）解的探讨和论证，解决了这类递推方程的求解问题，对指导中学数学竞赛和这类问题的应用有一定的参考价值。
|
| 关 键 词： | 二阶递推方程 通项 数列变换 迭代 求解问题 数列 组合数学 |
| 文章编号： | 1004-9444(2001)04-0011-05 |
| 修稿时间： | 2001年8月21日 |
The solving and applying of the two rank recursion equation as an + 2 = f(n)an + g(n) |
| |
| HUA Yang-biao.The solving and applying of the two rank recursion equation as an + 2 = f(n)an + g(n)[J].Journal of Dezhou University,2001,17(4):11-15. |
| |
| Authors: | HUA Yang-biao |
| |
| Abstract: | After discussing and arguing the two rank recursion equation as a\-\{n+2\}=f(n)a\-n+g(n),this article resolves how to solve these recursion equation,and it will be great value for guiding the mathematics competition in high school and application of these recursion equation. |
| |
| Keywords: | recursion general term sequence transformation iterative |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
