Distribution of the partition function modulo $m$

By Ken Ichi Ono. 2000

240 citations recorded by the source corpus.

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove that there are infinitely many such congruences for every prime modulus exceeding 3. In addition, we provide a simple criterion guaranteeing the truth of Newman's conjecture for any prime modulus exceeding 3 (recall that Newman's conjecture asserts that the partition function hits every residue class modulo a given integer M infinitely often).

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/f4e69d8f7b24256c973d20869cd3787142e717c3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Kathrin Bringmann
  2. Ken Ichi Ono
  3. Heng Huat Chan
  4. Jeremy Lovejoy
  5. George E. Andrews
  6. Stephanie Treneer
  7. David Penniston
  8. J. J. Webb

In Discrete Mathematics and Combinatorics

  1. Kathrin Bringmann
  2. Ken Ichi Ono
  3. Jeremy Lovejoy
  4. George E. Andrews
  5. Heng Huat Chan
  6. Stephanie Treneer
  7. J. J. Webb
  8. David Penniston

Citations in the corpus