Elementary proofs of infinitely many congruences for 8-cores

Louis W. Kolitsch, James Allen Sellers

Research output: Contribution to journalArticle

14 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)221-226
Number of pages6
JournalRamanujan Journal
Volume3
Issue number2
DOIs
StatePublished - Jan 1 1999

Fingerprint

Congruence
Modulo
Partition
Family

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory

Cite this

Kolitsch, Louis W. ; Sellers, James Allen. / Elementary proofs of infinitely many congruences for 8-cores. In: Ramanujan Journal. 1999 ; Vol. 3, No. 2. pp. 221-226.
@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 Allen}",
year = "1999",
month = "1",
day = "1",
doi = "10.1023/A:1006953609540",
language = "English (US)",
volume = "3",
pages = "221--226",
journal = "Ramanujan Journal",
issn = "1382-4090",
publisher = "Springer Netherlands",
number = "2",

}

Elementary proofs of infinitely many congruences for 8-cores. / Kolitsch, Louis W.; Sellers, James Allen.

In: Ramanujan Journal, Vol. 3, No. 2, 01.01.1999, p. 221-226.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Kolitsch, Louis W.

AU - Sellers, James Allen

PY - 1999/1/1

Y1 - 1999/1/1

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

VL - 3

SP - 221

EP - 226

JO - Ramanujan Journal

JF - Ramanujan Journal

SN - 1382-4090

IS - 2

ER -