A proof of Subbarao%26apos;s conjecture

作者:Radu Cristian Silviu*
来源:Journal fur die Reine und Angewandte Mathematik, 2012, 672: 161-175.
DOI:10.1515/CRELLE.2011.165

摘要

Let p(n) denote the ordinary partition function. Subbarao conjectured that in every arithmetic progression r (mod t) there are infinitely many integers N equivalent to r (mod t) for which p(N) is even, and infinitely many integers M equivalent to r (mod t) for which p(M) is odd. In the even case the conjecture was settled by Ken Ono. In this paper we prove the odd part of the conjecture which together with Ono%26apos;s result implies the full conjecture. We also prove that for every arithmetic progression r (mod t) there are infinitely many integers N equivalent to r (mod t) such that p(N) not equivalent to 0 (mod 3), which settles an open problem posed by Scott Ahlgren and Ken Ono.

  • 出版日期2012-11