A Partition Theorem of Subbarao

From MaRDI portal





Using generating functions, \textit{M. V. Subbarao} [Proc. Am. Math. Soc. 27, 449--450 (1971; Zbl 0219.10022)] proved the Theorem: Let \(C(n)\) be the number of partitions of \(n\) such that all even multiplicities of the parts are less than \(2m\), \(m>1\); and all odd multiplicities are at least \((2r+1)\) and at most \(2(m+r) -1\), \(r\ge 0\). Let \(D(n)\) be the number of partitions of \(n\) into parts which are either odd multiples of \((2r + 1)\) or are even and not divisible by \(2m\). Then \(C(n) = D(n)\). In this paper, the author proves the theorem directly by setting up a one-one and onto correspondence between the two types of partitions.











This page was built for publication: A Partition Theorem of Subbarao

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777369)