Elementary proofs of infinitely many congruences for 8-cores (Q1306586)

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.