摘要
设n是正整数,n-分拆是指将n表为一个或多个正整数的和的形式.两个和式若仅有加数顺序的差异则视为相同的分拆.称和式中的每个加数为这个n-分拆的一个部分.以Pr(n)表示部分数为r的n-分拆的个数.该文研究了部分数为7的n-分拆,得到了P7(n)的简易计算公式.
A partition of a positive integer is a way of writing as a sum of one or more positive integers. Two sums which only differ in the order of their summands are considered to be the same partition. A summand in a partition is also called a part. The number of partitions of into exactly parts is denoted in this paper, we study the partitions of into exactly 7 parts, and obtain a counting formula for it.
出处
《广西师范学院学报（自然科学版）》
2009年第1期51-57,共7页
Journal of Guangxi Teachers Education University(Natural Science Edition)
基金
国家自然科学基金(10601038)
高等学校博士学科点专项科研基金(20070574006)
关键词
分拆
部分
不定(丢番图)方程
计数公式
partition
part
indeterminate（Diophantine） equation
counting formula
