The diophantine Frobenius problem / J.L. Ramírez Alfonsín.

Format:

Book

Author/Creator:

Ramírez Alfonsin, Jorge L.

Contributor:

John G. Hartman Memorial Library Fund.

Series:

Oxford lecture series in mathematics and its applications ; 30.

Oxford lectures series in mathematics and its applications ; 30

Language:

English

Subjects (All):

Frobenius algebras.

Frobenius groups.

Diophantine analysis.

Physical Description:

xvi, 243 pages : illustrations ; 24 cm.

Place of Publication:

Oxford ; New York : Oxford University Press, 2005.

Summary:

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.

Notes:

Includes bibliographical references (pages [205]-239) and index.

Local Notes:

Acquired for the Penn Libraries with assistance from the John G. Hartman Memorial Library Fund.

ISBN:

0198568207

OCLC:

61109311

Publisher Number:

9780198568209