Partition Identities and the Coin Exchange Problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 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 pages

Keywords

Combinatorics, Number Theory, 05A17; 11P81; 11P83

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/131822

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0706.2282
 http://arxiv.org/abs/0706.2282

Collections

arXiv