Abstract
AbstractRamanujan 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.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Statistics and Probability
Reference8 articles.
1. A Table of Partitions
2. A simple proof of the Ramanujan conjecture for powers of 5;Hirschhorn;J. Reine Angew. Math.,1981
3. Some properties of p(n), the number of partitions of n;Ramanujan;Proc. Cambridge Philos. Soc.,1919
4. Congruence Properties of Partitions
5. Ramanujans Vermutung über Zerfällungsanzahlen;Watson;J. Reine Angew. Math.,1938
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献