The partition function in arithmetic progressions (Q1271230)

Extending some of his own earlier work, the author makes the following conjecture, which is a refinement of a conjecture by Subbarao: Conjecture 2: If \(t\) is prime, let \(r\) be an integer such that \(24r\not\equiv 1\pmod t\). Then there exist infinitely many \(M\) such that \(M\equiv r\pmod t\) and \(p(M)\) is odd. Using the theory of modular forms, he proves that conjecture 2 holds for a set of primes whose density exceeds \(1- 10^{-1500}\).