Elementary proofs of infinitely many congruences for 8-cores (Q1306586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1347445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Elementary proofs of infinitely many congruences for 8-cores |
scientific article; zbMATH DE number 1347445 |
Statements
Elementary proofs of infinitely many congruences for 8-cores (English)
0 references
29 June 2000
0 references
From the paper's abstract: Using a very elementary argument, we prove the congruences \[ a_8(81n + 21) \equiv 0 \pmod 2 \quad \text{and}\quad a_8(81n + 75) \equiv 0 \pmod 2 \] where \(a_8(n)\) is the number of 8-core partitions of \(n\). We also exhibit two infinite families of congruences modulo 2 for 8-cores.
0 references
partitions
0 references
congruences
0 references
\(t\)-cores
0 references
0.7805331349372864
0 references
0.7485339045524597
0 references
0.7476024031639099
0 references
