Das, Sabuj and Mohajan, Haradhan (2014): Generating Functions for X(n) and Y(n). Published in: American Review of Mathematics and Statistics , Vol. 2, No. 1 (1 May 2014): pp. 41-43.
Preview |
PDF
MPRA_paper_55685.pdf Download (33kB) | Preview |
Abstract
This paper shows how to prove the Theorem , i.e., the number of partitions of n with no part repeated more than twice is equal to the number of partitions of n with no part is divisible by 3.
Item Type: | MPRA Paper |
---|---|
Original Title: | Generating Functions for X(n) and Y(n) |
English Title: | Generating Functions for X(n) and Y(n) |
Language: | English |
Keywords: | Infinite factors, enumerated by X(n) |
Subjects: | C - Mathematical and Quantitative Methods > C0 - General > C02 - Mathematical Methods |
Item ID: | 55685 |
Depositing User: | Haradhan Kumar Mohajan |
Date Deposited: | 05 May 2014 14:19 |
Last Modified: | 05 Oct 2019 16:44 |
References: | Andrews, G.E. (1987). Introduction to Srinivasa Ramanujan: the Lost Notebook and Other Unpublished Papers, Narosa, New Delhi. Burn, R.P. (1996). A Pathway into Number Theory, 2nd Edition, Cambridge University Press, Cambridge. |
URI: | https://mpra.ub.uni-muenchen.de/id/eprint/55685 |