A note on odd partition numbers
Abstract
Ramanujan's celebrated partition congruences modulo ∈ \5, 7, 11\ assert that p( n+δ) 0, where 0<δ< satisfies 24δ 1. 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, we give a new proof of the conclusion that there are infinitely many m for which p( m+δ) 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 m satisfies m<(2-1)/24, representing a significant improvement to the previous bound.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.