The Diophantine Frobenius Problem

Author/creator Alfonsín, Jorge L. Ramírez Author
Format Electronic
Publication InfoNew York : Oxford University Press, Incorporated
Description260 p. ill 06.300 x 09.300 in.
Supplemental ContentFull text available from eBooks on EBSCOhost
Subjects

SeriesOxford Lecture Series in Mathematics and Its Applications Ser.
Summary Annotation 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 ia1,...,an,/i find the largest natural number (called the Frobenius number and denoted by ig(a1,...,an/i)that is not representable as a nonnegative integer combination of ia1,...,an,/i .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 formulagiving 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.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
LCCN 2005019571
ISBN9780198568209
ISBN0198568207 (Trade Cloth) On Demand
Standard identifier# 9780198568209
Stock number00020142

Availability

Library Location Call Number Status Item Actions
Electronic Resources Access Content Online ✔ Available