Diophantine Frobenius Problem

Name: Diophantine Frobenius Problem
Price: 186.66 USD
Availability: InStock
ISBN: 9780198568209

ISBN-10: 0198568207

ISBN-13: 9780198568209

Edition: 2005

Authors: Jorge L. Ramï¿½rez Alfonsï¿½n

List price: $180.00

30 day, 100% satisfaction guarantee!

Marketplace

1 new & used from $186.66

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he following problem, known as the Frobenius Problem (FP): given relatively prime positive integers a1,...,an, find the largest natural number (called the Frobenius number and denoted by g(a1,...,an) that is not representable as a nonnegative integer combination of a1,...,an, .At first glance FP may look deceptively specialized. Nevertheless it crops up again and again in the most unexpected places and has been extremely useful in investigating many different problems. A number of methods, from several areas of mathematics, have been used in the hope of finding a formula giving the Frobenius number and…

Book details

List price: $180.00
Copyright year: 2005
Publisher: Oxford University Press, Incorporated
Publication date: 2/2/2006
Binding: Hardcover
Pages: 260
Size: 2.56" wide x 9.45" long x 0.75" tall
Weight: 1.144
Language: English



Preface


Acknowledgements



Algorithmic Aspects



The Frobenius Number for Small n



The General Problem



Sylvester Denumerant



Integers without Representation



Generalizations and Related Problems



Numerical Semigroups



Applications of the Frobenius Number



Appendix A


Bibliography