| | | | | On the Use of the Initial Values of Recursions | | | <正>In this paper we make a study of the use of the iniiai values of a recursion skilfully, so that the count for finding a solution of any recursion will be more simplified. Finally, we give out the "moving forth prineiple" of initial values of a recursion.
【DOI】：cnki:ISSN:1008-018X.0.1992-06-000
【正文快照】：
1 Start With An Example We get a start in an example.Here w’e solve the foliowi吣recurfion 移(,1)一3v(n一1)+加(一一2)=6n。 for"in(2.3.…)together with the initial values【I’ v(0)=6.移(1)=7where v(,1)is the required solution. The character'istic pcdynomial l茜 ’, ..’(1)(2) K【z)=,一缸+2;(z—1)(z一2)Using the notations of Theorem 2(See[1],P.534),l‘I=6一。has r—l,户=;:2·and辨=1.Also,the recursion(1)shows that the order d=2.And SO.-particular mlutioa tO(1)exists in the form 地=an+6,l… | | |  推荐 CAJ下载  PDF下载 | | | CAJViewer7.0阅读器支持所有CNKI文件格式，AdobeReader仅支持PDF格式 | | | | On the Use of the Initial Values of Recursions | | | Wu Qiqi | | | In this paper we make a study of the use of the iniial values of a recursion skilfully, so that the count for finding a solution of any recursion will be more simplified. Finally, we give out the " moving forth principle" of initial values of a recursion.
【Keyword】：recursion, solution, initial values |
|
|
