The Diophantine Frobenius Problem | Zookal Textbooks | Zookal Textbooks
  • Author(s) Jorge L. Ramírez Alfonsín
  • Edition
  • Published19th January 2006
  • PublisherOxford University Press UK
  • ISBN9780198568209
During 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.

The Diophantine Frobenius Problem

Format
In stock at supplier

Leaves in 1-4 weeks

$160.79 $192.95 Save $32.16
or 4 payments of $40.19 with Zookal accepts Afterpay
Add Zookal Study FREE trial and save a further 20% 

NEW PRICE

$128.63 + free shipping

(20% off - save $32.16)

Zookal Study Free trial

14-day FREE trial. $14.95/mo after. Cancel anytime.

*Discount will apply at checkout.

 See terms and conditions

You will get a further 20% off for this item ($128.63 after discount) because you have added Zookal Study Premium Free Trial to your bag.

For this discount to apply, you will need to complete checkout with the Zookal Study Premium Free Trial in your bag.

-
+
  • Author(s) Jorge L. Ramírez Alfonsín
  • Edition
  • Published19th January 2006
  • PublisherOxford University Press UK
  • ISBN9780198568209
During 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.
translation missing: en.general.search.loading