Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-24T18:39:07.039Z Has data issue: false hasContentIssue false
  • English
  • Français

Proof of a conjecture of Ramanujan

Published online by Cambridge University Press:  18 May 2009

A. O. L. Atkin
A. O. L. Atkin
Affiliation:
The Atlas Computer LaboratoryChilton, Didcot
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We write

and

so that p(n) is the number of unrestricted partitions of n. Ramanujan [1] conjectured in 1919 that if q = 5, 7, or 11, and 24m ≡ 1 (mod qn), then p(m) ≡ 0 (mod qn). He proved his conecture for n = 1 and 2†, but it was not until 1938 that Watson [4] proved the conjecture for q = 5 and all n, and a suitably modified form for q = 7 and all n. (Chowla [5] had previously observed that the conjecture failed for q = 7 and n = 3.) Watson's method of modular equations, while theoretically available for the case q = 11, does not seem to be so in practice even with the help of present-day computers. Lehner [6, 7] has developed an essentially different method, which, while not as powerful as Watson's in the cases where Γ0(q) has genus zero, is applicable in principle to all primes q without prohibitive calculation. In particular he proved the conjecture for q = 11 and n = 3 in [7]. Here I shall prove the conjecture for q = 11 and all n, following Lehner's approach rather than Watson's. I also prove the analogous and essentially simpler result for c(m), the Fourier coefficient‡ of Klein's modular invariant j (τ) as

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 8 , Issue 1 , January 1967 , pp. 14 - 32
Copyright
Copyright © Glasgow Mathematical Journal Trust 1967

References

1.Ramanujan, S., Some properties of p(n), the number ofpartitions of n Proc. Cambridge Phil. Soc. 19 (1919), 207–210.Google Scholar
2.Ramanujan, S., Congruence properties of partitions, Math. Z. 9 (1921), 147–153.CrossRefGoogle Scholar
3.Rushforth, J. M., Congruence properties of the partition function and associated functions, Proc. Cambridge Phil. Soc. 48 (1952), 402–413.CrossRefGoogle Scholar
4.Watson, G. N., Ramanujans Vermutung über Zerfallungsanzahlen. J. Reine Angew. Math. 179 (1938), 97–128.CrossRefGoogle Scholar
5.Chowla, S., Congruence properties of partitions, J. London Math. Soc. 9 (1934), 247.CrossRefGoogle Scholar
6.Lehner, J., Ramanujan identities involving the partition function for the moduli 115, Amer. J. Math. 65 (1943), 492–520.CrossRefGoogle Scholar
7.Lehner, J., Proof of Ramanujan's partition congruence for the modulus IP, Proc. Amer. Math. Soc. 1 (1950), 172–181.Google Scholar
8.Lehner, J., Divisibility properties of the Fourier coefficients of the modular invariant j(r) Amer. J. Math. 71 (1949), 136–148.CrossRefGoogle Scholar
9.Newman, M., Further identities and congruences for the coefficients of modular forms, Canadian J. Math. 10 (1958), 577–586.Google Scholar
10.Newman, M., Remarks on some modular identities, Trans. Amer. Math. Soc. 73 (1952), 313–320.CrossRefGoogle Scholar
11.Fine, N. J., On a system of modular functions connected withthe Ramanujan identities, Tohoku Math. J. 8 (1956), 149–164.Google Scholar
12.Atkin, A. O. L. and Hussain, S. M., Some properties of partitions (2), Trans. Amer. Math. Soc. 89 (1958), 184–200.Google Scholar