This means that:
- If a number is 4 more than a multiple of 5, i.e. it is in the sequence
- 4, 9, 14, 19, 24, 29, . . .
- then the number of its partitions is a multiple of 5.
- If a number is 5 more than a multiple of 7, i.e. it is in the sequence
- 5, 12, 19, 26, 33, 40, . . .
- then the number of its partitions is a multiple of 7.
- If a number is 6 more than a multiple of 11, i.e. it is in the sequence
- 6, 17, 28, 39, 50, 61, . . .
- then the number of its partitions is a multiple of 11.
then stated that "It appears there are no equally simple properties for any moduli involving primes other than these".
After Ramanujan died in 1920, G. H. Hardy extracted proofs of all three congruences from an unpublished manuscript of Ramanujan on p(n) (Ramanujan, 1921). The proof in this manuscript employs Eisenstein series.
In 1944, Freeman Dyson defined the rank function and conjectured the existence of a crank function for partitions that would provide a combinatorial proof of Ramanujan's congruences modulo 11. Forty years later, George Andrews and Frank Garvan successfully found such a function, and proved the celebrated result that the crank simultaneously "explains" the three Ramanujan congruences modulo 5, 7 and 11.
Extending the results of A. Atkin, Ken Ono in 2000 proved that there are such Ramanujan congruences modulo every integer coprime to 6. For example, his results give
Later Ken Ono conjectured that the elusive crank also satisfies exactly the same types of general congruences. This was proved by his Ph.D. student Karl Mahlburg in his 2005 paper Partition Congruences and the Andrews–Garvan–Dyson Crank, linked below. This paper won the first Proceedings of the National Academy of Sciences Paper of the Year prize.
It is seen to have dimension 0 only in the cases where ℓ = 5, 7 or 11 and since the partition function can be written as a linear combination of these functions this can be considered a formalization and proof of Ramanujan's observation.
In 2001, R.L. Weaver gave an effective algorithm for finding congruences of the partition function, and tabulated 76,065 congruences. This was extended in 2012 by F. Johansson to 22,474,608,014 congruences, one large example being
- Tau-function, for which there are other so-called Ramanujan congruences
- Rank of a partition
- Crank of a partition
- Ramanujan, S. (1921). "Congruence properties of partitions". Mathematische Zeitschrift. 9: 147–153. doi:10.1007/bf01378341.
- "Cozzarelli Prize". National Academy of Sciences. June 2014. Retrieved 2014-08-06.
- Folsom, Amanda; Kent, Zachary A.; Ono, Ken (2012). "ℓ-Adic properties of the partition function". Advances in Mathematics. 229 (3): 1586. doi:10.1016/j.aim.2011.11.013.
- Bruinier, J. H.; Ono, K. "Algebraic Formulas for the Coefficients of Half-Integral Weight Harmonic Weak Maas Forms" (PDF). arXiv: .
- Weaver, Rhiannon L. (2001). "New congruences for the partition function". The Ramanujan Journal. 5: 53. doi:10.1023/A:1011493128408.
- Johansson, Fredrik (2012). "Efficient implementation of the Hardy–Ramanujan–Rademacher formula". LMS Journal of Computation and Mathematics. 15: 341. doi:10.1112/S1461157012001088.
- Ono, Ken (2000). "Distribution of the partition function modulo m". Annals of Mathematics. Second Series. 151 (1): 293–307. doi:10.2307/121118. JSTOR 121118. Zbl 0984.11050.
- Ono, Ken (2004). The web of modularity: arithmetic of the coefficients of modular forms and q-series. CBMS Regional Conference Series in Mathematics. 102. Providence, RI: American Mathematical Society. ISBN 0-8218-3368-5. Zbl 1119.11026.
- Ramanujan, S. (1919). "Some properties of p(n), the number of partitions of n". Proceedings of the Cambridge Philosophical Society. 19: 207–210. JFM 47.0885.01.