The Diophantine Frobenius Problem Contributor(s): Ramírez Alfonsín, Jorge L. (Author) |
|||
ISBN: 0198568207 ISBN-13: 9780198568209 Publisher: Oxford University Press, USA
Binding Type: Hardcover - See All Available Formats & Editions Published: February 2006 Annotation: 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. Click for more in this series: Oxford Lecture Series in Mathematics and Its Applications |
Additional Information |
BISAC Categories: - Mathematics | Number Theory |
Dewey: 512.7 |
LCCN: 2005019571 |
Series: Oxford Lecture Series in Mathematics and Its Applications |
Physical Information: 0.8" H x 6.1" W x 9.2" L (1.15 lbs) 260 pages |
Features: Bibliography, Illustrated, Index, Table of Contents |
Descriptions, Reviews, Etc. |
Publisher Description: 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. |
Customer ReviewsSubmit your own review |
To tell a friend about this book, you must Sign In First! |