1. Algorithmic aspects -- 2. The Frobenius number for small n -- 3. The general problem -- 4. Sylvester denumerant -- 5. Integers without representation -- 6. Generalizations and related problems -- 7. Numerical semigroups
Summary
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 these viewpoints, ideas and applications to a broader audience
Bibliography
Includes bibliographical references (pages 205-239) and index
