Elementary proofs of infinitely many congruences for 8-cores

Louis W. Kolitsch; James A. Sellers

doi:10.1023/A:1006953609540

Elementary proofs of infinitely many congruences for 8-cores

Louis W. Kolitsch, James A. Sellers

Mathematics

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

17 Scopus citations

Abstract

Using a very elementary argument, we prove the congruences a₈(81n + 21) ≡ 0 (mod 2) and a₈(81n + 75) ≡ 0 (mod 2) where a₈(n) is the number of 8-core partitions of n. We also exhibit two infinite families of congruences modulo 2 for 8-cores.

Original language	English (US)
Pages (from-to)	221-226
Number of pages	6
Journal	Ramanujan Journal
Volume	3
Issue number	2
DOIs	https://doi.org/10.1023/A:1006953609540
State	Published - 1999

All Science Journal Classification (ASJC) codes

Algebra and Number Theory

Access to Document

10.1023/A:1006953609540

Cite this

@article{ecfd9d28acf64156a497de9c67150d95,

title = "Elementary proofs of infinitely many congruences for 8-cores",

abstract = "Using a very elementary argument, we prove the congruences a8(81n + 21) ≡ 0 (mod 2) and a8(81n + 75) ≡ 0 (mod 2) where a8(n) is the number of 8-core partitions of n. We also exhibit two infinite families of congruences modulo 2 for 8-cores.",

author = "Kolitsch, {Louis W.} and Sellers, {James A.}",

year = "1999",

doi = "10.1023/A:1006953609540",

language = "English (US)",

volume = "3",

pages = "221--226",

journal = "Ramanujan Journal",

issn = "1382-4090",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - Elementary proofs of infinitely many congruences for 8-cores

AU - Kolitsch, Louis W.

AU - Sellers, James A.

PY - 1999

Y1 - 1999

N2 - Using a very elementary argument, we prove the congruences a8(81n + 21) ≡ 0 (mod 2) and a8(81n + 75) ≡ 0 (mod 2) where a8(n) is the number of 8-core partitions of n. We also exhibit two infinite families of congruences modulo 2 for 8-cores.

AB - Using a very elementary argument, we prove the congruences a8(81n + 21) ≡ 0 (mod 2) and a8(81n + 75) ≡ 0 (mod 2) where a8(n) is the number of 8-core partitions of n. We also exhibit two infinite families of congruences modulo 2 for 8-cores.

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

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

U2 - 10.1023/A:1006953609540

DO - 10.1023/A:1006953609540

M3 - Article

AN - SCOPUS:22644448737

SN - 1382-4090

VL - 3

SP - 221

EP - 226

JO - Ramanujan Journal

JF - Ramanujan Journal

IS - 2

ER -

Elementary proofs of infinitely many congruences for 8-cores

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this