Generating Functions for P1r (n) and P2r (n)

Sabuj Das and Dr Haradhan Mohajan ()

MPRA Paper from University Library of Munich, Germany

Abstract: In 1970 George E. Andrews defined the generating functions for P1r (n) and P2r (n). In this article these generating functions are discussed elaborately. This paper shows how to prove the theorem P2r (n) = P3r (n) with a numerical example when n = 9 and r = 2. In 1966 Andrews defined the terms A/(n) and B/(n), but this paper proves the remark A/(n) = B/(n) with the help of an example when n = 10. In 1961, N. Bourbaki defined the term P(n, m). This paper shows how to prove a Remark in terms of P(n, m), where P(n, m) is the number of partitions of the type of enumerated by P3r (n ) with the further restrictions that b1

Keywords: Generating functions; number of partitions. (search for similar items in EconPapers)
JEL-codes: C3 (search for similar items in EconPapers)
Date: 2014-02-24, Revised 2014-05-30
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Published in Journal of Environmental Treatment Techniques 2.2(2014): pp. 55-57

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/83698/1/MPRA_paper_83698.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:83698

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 ().