Some properties of perfect partitions (Q1184886)

An unrestricted partition of \(n\) is said to be perfect if it contains as a subsum exactly one partition of every integer up to \(n\) when repeated parts are regarded as indistinguishable. Let \(\text{Per}(n)\) denote the number of perfect partitions of \(n\). In the paper under review some elementary properties of perfect partitions are discussed. Several observations are inspired by the results of \textit{Wang E Fang} (reviewed below). For instance, the authors obtain the following Ramanujan type congruence. For \(n\geq 1\), \(k\geq 2\) and any prime \(q\), \(\text{Per}(nq^ k-1)\equiv 0\bmod{2^{k-1}}\). The notion of perfect partitions is extended to partitions with ``\(d(m)\) copies of \(m\)'', i.e., to partitions of \(n\) with subscripted summands in which the subscript is at most the number of positive divisors of the summand.