Abstract
We study (FORMULA PRESENT) qd(n)number of partitions of n into parts differing by at least d, and Qd(n) is the number of partitions of n into parts congruent to 1 or d + 2 (mod d + 3). We prove that (FORMULA PRESENT) with n for (FORMULA PRESENT) for all n if (FORMULA PRESENT).
Original language | English (US) |
---|---|
Pages (from-to) | 279-284 |
Number of pages | 6 |
Journal | Pacific Journal of Mathematics |
Volume | 36 |
Issue number | 2 |
DOIs | |
State | Published - Feb 1971 |
All Science Journal Classification (ASJC) codes
- General Mathematics