Abstract
In this paper the following theorem is proved and generalized. The partitions of any positive integer, n, into parts of the forms 6m+2, 6m+3, 6m+4 are equinumerous with those partitions of n into parts ≧2 which neither involve sequences nor allow any part to appear more than twice.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 431-436 |
| Number of pages | 6 |
| Journal | Journal of Combinatorial Theory |
| Volume | 2 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jun 1967 |
Fingerprint
Dive into the research topics of 'Some new partition theorems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver