2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/131822The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes identities of MacMahon and Andrews. The analogous identities for three or more integers (in place of a,b) hold in certain cases.6 pagesCombinatoricsNumber Theory05A17; 11P81; 11P83Partition Identities and the Coin Exchange Problemtext