The diophantine Frobenius problem /
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.
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Oxford ; New York :
Oxford University Press,
2005.
|
| Series: | Oxford lecture series in mathematics and its applications ;
30. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of Contents:
- 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.