Partition Identities and the Coin Exchange Problem

Simple item page
dc.creatorHolroyd, Alexander E.
dc.date2007-06-15
dc.date.accessioned2026-07-07T08:10:25Z
dc.date.available2026-07-07T08:10:25Z
dc.descriptionThe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0706.2282
dc.identifierhttp://arxiv.org/abs/0706.2282
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131822
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject05A17; 11P81; 11P83
dc.titlePartition Identities and the Coin Exchange Problem
dc.typetext

Files

Collections

arXiv