Summary
Let p(M, N, n) be the number of partitions of the integer n into at most M parts, each containing integers at most N. Then p(M, N, n) = p(N, M, n). That is, you can swap the size of the partition multisets and the upper bound on the elements in the multisets. For example, […] The post Partition symmetry first appeared on John D. Cook....