Generating Functions for X(n) and Y(n)

Sabuj Das and Dr Haradhan Mohajan (haradhan1971@gmail.com)

MPRA Paper from University Library of Munich, Germany

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.

Keywords: Infinite factors; enumerated by X(n) (search for similar items in EconPapers)
JEL-codes: C02 (search for similar items in EconPapers)
Date: 2014-01-10, Revised 2014-01-30
References: View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Published in American Review of Mathematics and Statistics 1.2(2014): pp. 41-43

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/55685/1/MPRA_paper_55685.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:55685

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter (winter@lmu.de).