On a partition problem of H. L. alder

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)279-284
Number of pages6
JournalPacific Journal of Mathematics
Volume36
Issue number2
DOIs
StatePublished - Feb 1971

Fingerprint

Partition
Congruent

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

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 = "2",
doi = "10.2140/pjm.1971.36.279",
language = "English (US)",
volume = "36",
pages = "279--284",
journal = "Pacific Journal of Mathematics",
issn = "0030-8730",
publisher = "University of California, Berkeley",
number = "2",

}

On a partition problem of H. L. alder. / Andrews, George E.

In: Pacific Journal of Mathematics, Vol. 36, No. 2, 02.1971, p. 279-284.

Research output: Contribution to journalArticle

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 - http://www.scopus.com/inward/record.url?scp=84972572218&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84972572218&partnerID=8YFLogxK

U2 - 10.2140/pjm.1971.36.279

DO - 10.2140/pjm.1971.36.279

M3 - Article

AN - SCOPUS:84972572218

VL - 36

SP - 279

EP - 284

JO - Pacific Journal of Mathematics

JF - Pacific Journal of Mathematics

SN - 0030-8730

IS - 2

ER -