Sold Out
Book Categories |
1 | Algorithmic aspects | 1 |
2 | The Frobenius number for small n | 31 |
3 | The general problem | 45 |
4 | Sylvester denumerant | 71 |
5 | Integers without representation | 103 |
6 | Generalizations and related problems | 119 |
7 | Numerical semigroups | 135 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionThe Diophantine Frobenius Problem
X
This Item is in Your InventoryThe Diophantine Frobenius Problem
X
You must be logged in to review the productsX
X
X
Add The Diophantine Frobenius Problem, 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, The Diophantine Frobenius Problem to the inventory that you are selling on WonderClubX
X
Add The Diophantine Frobenius Problem, 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, The Diophantine Frobenius Problem to your collection on WonderClub |