A note on odd partition numbers
Abstract
Ramanujan's celebrated partition congruences modulo assert that where satisfies 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 we give a new proof of the conclusion that there are infinitely many for which 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 satisfies representing a significant improvement to the previous bound.
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