{"product_id":"the-diophantine-frobenius-problem","title":"The Diophantine Frobenius Problem","description":"\u003cp\u003eDuring the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he 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 FP 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.\u003c\/p\u003e","brand":"Jorge L. Ramírez Alfonsín","offers":[{"title":"Default Title","offer_id":43573203402813,"sku":"9780198568209","price":354.0,"currency_code":"AUD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0597\/7689\/2989\/files\/9780198568209.jpg?v=1788512266","url":"https:\/\/www.palmleaf.com.au\/products\/the-diophantine-frobenius-problem","provider":"Palmleaf","version":"1.0","type":"link"}