| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656411 | Journal of Combinatorial Theory, Series A | 2008 | 6 Pages |
Abstract
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a and b. This generalizes identities of MacMahon and Andrews. The analogous identities for three or more integers (in place of a,b) hold in certain cases.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
