Books > Science & Mathematics > Mathematics > Number theory
|
Buy Now
The Diophantine Frobenius Problem (Hardcover)
Loot Price: R4,073
Discovery Miles 40 730
You Save: R736
(15%)
|
|
The Diophantine Frobenius Problem (Hardcover)
Series: Oxford Lecture Series in Mathematics and Its Applications
Expected to ship within 12 - 17 working days
|
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
number and denoted by g(a1,, an) that is not representable as a
nonnegative integer combination of a1,, an.
At first glance FB 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.