Partition identities and the coin exchange problem

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:115

Article

Holroyd, Alexander E.

关键词: partition identity;    coin problem;    Frobenius problem;   

DOI  :  10.1016/j.jcta.2007.12.003

来源: Elsevier

【 摘 要 】

The 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 and 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. (C) 2008 Elsevier Inc. All rights reserved.

【 授权许可】

Free