有关正整数的一类分拆数的计算  

A Recursive Relation for Partition Number of Positive Integer

作　　者：郭育红[1] 

机构地区：[1]河西学院数学系,甘肃张掖734000

出　　处：《甘肃联合大学学报（自然科学版）》2006年第5期30-32,共3页Journal of Gansu Lianhe University :Natural Sciences

摘　　要：讨论了正整数n的一些带约束条件的分拆问题.给出了计算其中三类分拆数的递推关系:一类为将n分拆成l个不同的分部(项),且分部量不超过正整数k的分拆数的递推关系;另一类为将n分拆成各分部量互不相同且分部量不超过k的分拆数的递推关系,进而给出了计算这类分拆数的一种计算方法;第三类为将正整数分拆成分部量不超过k且互不相同的奇偶分拆数的递推关系.In this paper,the author discuss the partitions of integer n with some conditions. And the recursive relations for three partition numbers are got. The first recursive relation is the number of partition with 1 distinct parts and each part does not exceed positive integer k. The second one is the number of partition with distinct part and each part does not exceed positive integer k. So the counting method for this partition number is given. The last one is the number of partition with distinct part and each part does not exceed positive integer k ,and its part is odd and even,respectively.

关 键 词：正整数的分拆 各分部量互不相同的分拆 奇偶分拆 递推关系 

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