组合数学的容斥原理与递归关系在数论中的应用研究实例  

The Inclusion Exclusion Principle of Combinatorial Mathematics and Application Research Example of Recursive Relations in the Number Theory

作　　者：周斌 

机构地区：[1]三明职业技术学院人文社科系,福建三明365000

出　　处：《西安文理学院学报（自然科学版）》2017年第4期5-10,共6页Journal of Xi’an University(Natural Science Edition)

摘　　要：组合数学是一门很重要的基础课程,而在组合数学中,容斥原理和递推关系是解决组合计数问题的一个重要工具,有利于学生数学思想的形成,对后继课程的理解学习具有重要的意义.将这一重要方法和工具应用到数论之中,在数论的计数问题的研究与论证中都具有不可替代的独特作用,同时带来了极大的方便.The combinatorial mathematics is an important basic course,In the combinatorial mathematics,the including excluding principle and the recurrence relation are an important tool to solve the combinatorial counting problems,which is beneficial to the formation of students＇ mathematical thinking,and is of great significance to understand and study the following courses.The important method and tool are applied to the number theory,in the research and demonstration of the number theory,it has the unique function which can not be replaced,and brings great convenience.

关 键 词：组合数学 容斥原理 递推关系 数论 

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