• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Diophantine Frobenius Problem

The Diophantine Frobenius Problem

Hardcover

Series: Oxford Lecture Mathematics and Its Applications

General Mathematics

ISBN10: 0198568207
ISBN13: 9780198568209
Publisher: Oxford University Press
Published: Feb 2 2006
Pages: 260
Weight: 1.15
Height: 0.80 Width: 6.10 Depth: 9.20
Language: English
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.

Also in

General Mathematics