New congruences for the partition function (Q5943746): Difference between revisions

Let \(p(n)\) denote the number of partitions of \(n\). Ramanujan's famous congruences are \[ p(5n+4)\equiv 0\pmod 5, \qquad p(7n+5)= 0\pmod 7, \qquad p(11n+6)\equiv 0\pmod {11}. \] A few other congruences for the partition function are known, for example \(p(11^3\cdot 13n+237)\equiv 0\pmod{13}\), found by Atkin and O'Brien in 1968. Recently, \textit{Ken Ono} [Ann. Math. (2) 151, 293-307 (2000; Zbl 0984.11050)] proved for every prime \(n\geq 5\), there are infinitely many congruences of the form \(p(An+B)\equiv 0\pmod m\). However, Ono's results were theoretical, and he gave only one new example: \(p(59^4\cdot 13n+ 111247)\equiv 0\pmod{13}\). In the paper under review, an algorithm is given for primes \(13\leq m\leq 31\), which yields more than 76000 new congruences. The reviewer agrees with Ono (Science News, June 17, 2000) that it is `` a great piece of work''.