| 一类分拆数的计算问题 |
| |
| 引用本文： | 郭育红.一类分拆数的计算问题[J].河西学院学报,2007,23(2):1-4. |
| |
| 作者姓名： | 郭育红 |
| |
| 作者单位： | 河西学院数学系,甘肃,张掖,734000 |
| |
| 摘 要： | 正整数n的分拆是指将正整数n表示成一个或多个正整数的无序和.设Q(n,m)是将正整数n分拆为m个互不相同的正整数之和的无序分拆数,而P(n,m)是将正整数n分拆成m个部分的无序分拆的分拆数.它们都是组合,图论,数论的重要概念和数据.本文得到了关于Q(n,m)的一个递推关系以及P(n,m)与Q(n,m)之间的直接关系,进而可以利用已有的一些结果来计算Q(n,m)的值.同时本文也讨论了Q(n,m)在图论中的一个应用.
|
| 关 键 词： | 正整数的分拆 递推关系 计数 应用 |
| 文章编号： | 24204891 |
| 修稿时间： | 06 5 2006 12:00AM |
Unit Root Test of AR(1)Model |
| |
| GUO Yu-hong.Unit Root Test of AR(1)Model[J].Journal of Hexi University,2007,23(2):1-4. |
| |
| Authors: | GUO Yu-hong |
| |
| Institution: | Department of Mathematics, Hexi University, Zhangye Gansu 734000 |
| |
| Abstract: | A partition of positive integer n is representation of n as unordered sum of one or more positive integers.Let Q(n,m) be the number of unordered partitions of an integer n into m distinct positive integers.And let P(n,m) be the number of unordered partitions of a positive integer n into m parts.They are all the important concepts in Combinatorics,Graph theory and Number theory.In this paper,a recurrence relation that Q(n,m) satisfies is given.The relation between P(n,m) and Q(n,m) is got.Thus we can compute the value of Q(n,m) by the conclusions which have been got.And we also study the application of Q(n,m) in Graph theory. |
| |
| Keywords: | Partition of positive integer Recurrence relation Count Application |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
