Distribution of the partition function modulo m
| dc.creator | Ono, Ken | |
| dc.date | 2000-08-17 | |
| dc.date.accessioned | 2026-07-07T04:36:52Z | |
| dc.date.available | 2026-07-07T04:36:52Z | |
| dc.description | 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). | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/math/0008140 | |
| dc.identifier | http://arxiv.org/abs/math/0008140 | |
| dc.identifier | Ann. of Math. (2) 151 (2000), no. 1, 293-307 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/59758 | |
| dc.subject | Number Theory | |
| dc.subject | 11P83 | |
| dc.title | Distribution of the partition function modulo m | |
| dc.type | text |