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 number and denoted by g(a1,, an) that is not representable as a nonnegative integer combination of a1,, an.
At first glance...more
At first glance...more
Hardcover, 243 pages
Published
February 2nd 2006
by Oxford University Press, USA
There is a good chance some of your friends read this book. Sign in to see!
sign in »
Friend Reviews
To see what your friends thought of this book,
please sign up.
This book is currently not featured on any Listopia lists.
Add this book to your favorite list »
Community Reviews
There are no discussion topics on this book yet.
Be the first to start one »

Loading...


