We writeandso thatp(n) is the number of unrestricted partitions ofn. Ramanujan [1] conjectured in 1919 that ifq= 5, 7, or 11, and 24m≡ 1 (modqn), then p(m) ≡ 0 (modqn). He proved his conecture forn= 1 and 2†, but it was not until 1938 that Watson [4] proved the conjecture forq= 5 and alln, and a suitably modified form forq= 7 and alln. (Chowla [5] had previously observed that the conjecture failed forq= 7 andn= 3.) Watson's method of modular equations, while theoretically available for the caseq= 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 primesqwithout prohibitive calculation. In particular he proved the conjecture forq= 11 andn= 3 in [7]. Here I shall prove the conjecture forq= 11 and alln, following Lehner's approach rather than Watson's. I also prove the analogous and essentially simpler result forc(m), the Fourier coefficient‡ of Klein's modular invariantj(τ) as