 If "A" has "k" elements whose greatest common divisor is 1, then

One may also simultaneously limit the number and size of the parts.Let "p"("N", "M"; "n") denote the number of partitions of "n" with at most "M" parts, each of size at most "N".Equivalently, these are the partitions whose Young diagram fits inside an "M" × "N" rectangle.