Partition Identities and the Coin Exchange Problem

Details Partition Identities and the Coin Exchange Problem Partition Identities and the Coin Exchange Problem

2007-06-15

arxiv.org/abs/0706.2282v1

Mathematics

Combinatorics

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Partition Identities and the Coin Exchange Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partition Identities and the Coin Exchange Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partition Identities and the Coin Exchange Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549576