论文部分内容阅读
将n个不同元素分成m堆(每堆至少一个,每堆个数可以不相等),一共有多少种不同的分法.这样的问题通常称为分堆问题.当n,m较小时这类问题解决起来并不困难,但要给出一般的结论却不容易.为了叙述方便,我们先来探讨这样的问题:将n个人分配到m个单位(每个单位至少一人,各单位人数可以不相等.n≥m),一共有多少种不同的分法.显然,这一问题的结果除以m!就是上面分堆问题的
The n different elements are divided into m heap (at least one for each heap, the number of each heap can not be equal), a total of how many different sub-method. Such a problem is usually called the sub-heap problem. To solve the problem is not difficult to solve, but to give general conclusions is not easy.For the convenience of narration, we first explore the problem: the n individuals assigned to m units (each unit at least one person, the number of units may not Equal. N ≥ m), a total of how many different sub-method. Obviously, the result of this problem divided by m!