
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
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.
This book investigates the Frobenius Problem, a classic challenge in number theory concerning the largest integer not representable as a non-negative linear combination of a given set of relatively prime positive integers. Jorge L. Ramírez Alfonsín, a specialist in combinatorics and number theory, synthesizes decades of research to provide a comprehensive overview of the problem's history and its diverse applications. The text explores the mathematical landscape surrounding the Frobenius number, detailing the various methodologies and algorithmic approaches developed to calculate it across different contexts.
What You Will Find
Experts recognize this work as a definitive reference for researchers and graduate students interested in the intersection of number theory and computational complexity. Readers frequently note the technical density of the prose, which serves as a rigorous guide for those seeking to understand the mechanics of the Frobenius Problem in depth.
Page Count:
260
Publication Date:
2006-02-02
Publisher:
Oxford University Press
ISBN-10:
0198568207
ISBN-13:
9780198568209
No comments yet. Be the first to share your thoughts!