The Diophantine Frobenius Problem

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 a1an find the largest natural number (called the Frobenius number and denoted by g(a1an) that is not representable as a nonnegative integer combination of a1an. 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.