论文部分内容阅读
计数问题也称排列组合问题,向来就以思维灵活巧妙、趣味性强而令数学爱好者乐此不疲。由于计数问题有其自身的特点,因而解计数问题要针对问题的不同特点寻求不同的解题策略,或抽象出具体的数学模型以方便计数;或对问题进行科学的分类,从而简化问题;或构造递推关系式,通过解递推关系式达到计数的目的。
Counting problems are also called arrangement and combination problems. They have always been clever and interesting in thinking, and math enthusiasts are happy. Since the counting problem has its own characteristics, the solution to the counting problem must be based on the different characteristics of the problem to seek different strategies for solving problems, or to abstract out specific mathematical models to facilitate the counting; or to scientifically classify the problems so as to simplify the problem; or Recursive relations are constructed to achieve the purpose of counting by solving the recurrence relations.