一类递归关系模型的求解方法  

The Method of Solving a Type of Recursive Relations Model

作　　者：赵天玉[1] 马烁[1] 

机构地区：[1]长江大学信息与数学学院,湖北荆州434023

出　　处：《大学数学》2009年第2期181-184,共4页College Mathematics

基　　金：长江大学科研发展基金资助项目

摘　　要：递归关系不仅在数学中有广泛应用,而且在计算机算法设计与分析中也有广泛应用.本文对Josephus问题进行了推广,得到一类更广泛的递归关系模型.讨论了这类模型的求解方法,采用d-进制记数法,给出了这类递归关系模型的解.Recursive relations have the extensive applications both in mathematics and in designing and analyzing computer algorithms. This paper expanded Josephus problem, getting a type of recursive relations models more extensively. Discussed the method of solving this type of models and gave the solutions of this type of models by using d-numeration system.

关 键 词：递归关系模型 d-进制记数法 参数 

分 类 号：O157.1[理学—数学]