Ebook Info
- Published: 2005
- Number of pages: 260 pages
- Format: PDF
- File Size: 3.73 MB
- Authors: Jorge L. Ramírez Alfonsín
Description
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.
User’s Reviews
Keywords
Free Download The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications Book 30) 1st Edition in PDF format
The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications Book 30) 1st Edition PDF Free Download
Download The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications Book 30) 1st Edition 2005 PDF Free
The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications Book 30) 1st Edition 2005 PDF Free Download
Download The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications Book 30) 1st Edition PDF
Free Download Ebook The Diophantine Frobenius Problem (Oxford Lecture Series in Mathematics and Its Applications Book 30) 1st Edition