On a partition problem of H. L. alder

George E. Andrews

doi:10.2140/pjm.1971.36.279

On a partition problem of H. L. alder

George E. Andrews

Mathematics

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

We study (FORMULA PRESENT) q_d(n)number of partitions of n into parts differing by at least d, and Q_d(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	https://doi.org/10.2140/pjm.1971.36.279
State	Published - Feb 1971

All Science Journal Classification (ASJC) codes

General Mathematics

Access to Document

10.2140/pjm.1971.36.279

Cite this

@article{830fe7e3e09743fcbfc60f674384683c,

title = "On a partition problem of H. L. alder",

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).",

author = "Andrews, \{George E.\}",

year = "1971",

month = feb,

doi = "10.2140/pjm.1971.36.279",

language = "English (US)",

volume = "36",

pages = "279--284",

journal = "Pacific Journal of Mathematics",

issn = "0030-8730",

publisher = "Mathematical Sciences Publishers",

number = "2",

}

TY - JOUR

T1 - On a partition problem of H. L. alder

AU - Andrews, George E.

PY - 1971/2

Y1 - 1971/2

N2 - 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).

AB - 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).

UR - https://www.scopus.com/pages/publications/84972572218

UR - https://www.scopus.com/pages/publications/84972572218#tab=citedBy

U2 - 10.2140/pjm.1971.36.279

DO - 10.2140/pjm.1971.36.279

M3 - Article

AN - SCOPUS:84972572218

SN - 0030-8730

VL - 36

SP - 279

EP - 284

JO - Pacific Journal of Mathematics

JF - Pacific Journal of Mathematics

IS - 2

ER -

On a partition problem of H. L. alder

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this