A new Rational Generating Function for the Frobenius Coin Problem

Details A new Rational Generating Function for the Frobenius Coin Problem A new Rational Generating Function for the Frobenius Coin Problem

2010-01-03

arxiv.org/abs/1001.0415v2

Computer Science

Discrete Mathematics

2 pages, 1 Theorem, I have now enhanced the explanation for Theorem-1

Scientific paper

An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to the number of ways in which coins from the given denominations can be arranged as a stack whose total monetary worth is i. We show that the Recurrence Relation for obtaining G(x), is linear, enabling G(x) to be expressed as a rational function, that is, G(x) = P(x)/Q(x), where both P(x) and Q(x) are Polynomials whose degrees are bounded by the largest coin denomination.

Affiliated with

Also associated with

No associations

Rating

A new Rational Generating Function for the Frobenius Coin 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 A new Rational Generating Function for the Frobenius Coin Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new Rational Generating Function for the Frobenius Coin Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6569