English

A note on odd partition numbers

Number Theory 2024-03-19 v2

Abstract

Ramanujan's celebrated partition congruences modulo {5,7,11}\ell\in \{5, 7, 11\} assert that p(n+δ)0(mod), p(\ell n+\delta_{\ell})\equiv 0\pmod{\ell}, where 0<δ<0<\delta_{\ell}<\ell satisfies 24δ1(mod).24\delta_{\ell}\equiv 1\pmod{\ell}. By proving Subbarao's Conjecture, Radu showed that there are no such congruences when it comes to parity. There are infinitely many odd (resp. even) partition numbers in every arithmetic progression. For primes 5,\ell \geq 5, we give a new proof of the conclusion that there are infinitely many mm for which p(m+δ)p(\ell m+\delta_{\ell}) is odd. This proof uses a generalization, due to the second author and Ramsey, of a result of Mazur in his classic paper on the Eisenstein ideal. We also refine a classical criterion of Sturm for modular form congruences, which allows us to show that the smallest such mm satisfies m<(21)/24,m<(\ell^2-1)/24, representing a significant improvement to the previous bound.

Keywords

Cite

@article{arxiv.2401.00982,
  title  = {A note on odd partition numbers},
  author = {Michael Griffin and Ken Ono},
  journal= {arXiv preprint arXiv:2401.00982},
  year   = {2024}
}

Comments

Corrects minor typos found by the referees

R2 v1 2026-06-28T14:06:29.207Z