| 恰有7个部分的n-分拆的计数 |
| |
| 引用本文： | 邢林燕,尤利华.恰有7个部分的n-分拆的计数[J].广西师范学院学报(自然科学版),2009,26(1). |
| |
| 作者姓名： | 邢林燕 尤利华 |
| |
| 作者单位： | 华南师范大学,数学科学学院,广东,广州,510631 |
| |
| 基金项目： | 国家自然科学基金，高等学校博士学科点专项科研基金 |
| |
| 摘 要： | 设n是正整数,n-分拆是指将n表为一个或多个正整数的和的形式. 两个和式若仅有加数顺序的差异则视为相同的分拆. 称和式中的每个加数为这个n-分拆的一个部分.以Pr(n)表示部分数为r的n-分拆的个数.该文研究了部分数为7的n-分拆, 得到了P7(n)的简易计算公式.
|
| 关 键 词： | 分拆 部分 不定(丢番图)方程 计数公式 |
A Counting Formula for the Partitions of into Exactly 7 Parts |
| |
| XING Lin-yan,YOU Li-hua.A Counting Formula for the Partitions of into Exactly 7 Parts[J].Journal of Guangxi Teachers Education University:Natural Science Edition,2009,26(1). |
| |
| Authors: | XING Lin-yan YOU Li-hua |
| |
| Institution: | School of Mathematical Sciences;South China Normal University;Guangzhou 510631;China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
