1
/
of
1
Oxford University Press, USA
The Diophantine Frobenius Problem
The Diophantine Frobenius Problem
Regular price
$160.00 USD
Regular price
Sale price
$160.00 USD
Shipping calculated at checkout.
Quantity
Couldn't load pickup availability
During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised the 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 FB 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 algorithms to calculate it. The main intention of this book is to highlight such methods, ideas, viewpoints and applications to a broader audience.
Author: Jorge L. Ramírez Alfonsín
Publisher: Oxford University Press, USA
Published: 02/02/2006
Pages: 260
Binding Type: Hardcover
Weight: 1.15lbs
Size: 9.20h x 6.10w x 0.80d
ISBN: 9780198568209
representable as a nonnegative integer combination of a1, an.
At first glance FB 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 algorithms to calculate it. The main intention of this book is to highlight such methods, ideas, viewpoints and applications to a broader audience.
Author: Jorge L. Ramírez Alfonsín
Publisher: Oxford University Press, USA
Published: 02/02/2006
Pages: 260
Binding Type: Hardcover
Weight: 1.15lbs
Size: 9.20h x 6.10w x 0.80d
ISBN: 9780198568209
This title is not returnable
Share
