A simple proof of Watson's partition congruences for powers of 7
- 1 February 1984
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
- Vol. 36 (3), 316-334
- https://doi.org/10.1017/s1446788700025386
Abstract
Ramanujan conjectured that if n is of a specific form then p(n), the number of unrestricted partitions of n, is divisible by a high power of 7. A modified version of Ramanujan's conjecture was proved by G. N. Watson.In this paper we establish appropriate generating formulae, from which Watson's results follow easily.Our proofs are more straightforward than those of Watson. They are elementary, depending only on classical identities of Euler and Jacobi. Watson's proofs rely on the modular equation of seventh order. We also need the modular equation but we derive it using the elementary techniques of O. Kolberg.Keywords
This publication has 7 references indexed in Scilit:
- A simple proof of the Ramanujan conjecture for powers of 5.Journal für die reine und angewandte Mathematik (Crelles Journal), 1981
- Ramanujan Congruences for p-k(n)Canadian Journal of Mathematics, 1968
- Some identities involving the partition functionMATHEMATICA SCANDINAVICA, 1957
- Identities analogous to Ramanujan’s identities involving the parition functionDuke Mathematical Journal, 1939
- Ramanujans Vermutung über Zerfällungszahlen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1938
- A Table of PartitionsProceedings of the London Mathematical Society, 1935
- Congruence Properties of PartitionsJournal of the London Mathematical Society, 1934