On the geometry of the Frobenius problem

On Shellsort and the frobenius problem

✍ Ernst S. Selmer 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 183 KB

On the Linear Diophantine Problem of Fro

On the Linear Diophantine Problem of Frobenius

✍ J.L. Davison 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Suppose \(a, b, c\) are three positive integers with \(\mathrm{gcd}=1\). We consider the function \(f(a, b, c)\) defined to be the largest integer not representable as a positive integral linear combination of \(a, b, c\). We give a new lower bound for \(f(a, b, c)\) which is shown to be tight, and

On the Extremal Aspect of the Frobenius

On the Extremal Aspect of the Frobenius Problem

✍ Vsevolod F. Lev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 347 KB

concerning the well-known diophantine problem of Frobenius was given an exact solution for linear forms with the set of coefficients of density 1 2 (or more). In the present paper, we advance this up to the density 1 3 .

The Diophantine Frobenius problem

✍ Jorge L. Ramírez Alfonsín 📂 Library 📅 2005 🏛 Oxford University Press 🌐 English ⚖ 1 MB

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 repre

The diophantine Frobenius problem

✍ Jorge L. Ramírez Alfonsín 📂 Library 📅 2005 🏛 Oxford University Press 🌐 English ⚖ 4 MB

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 repre

Analogues of the Frobenius problem

✍ V. K. Leont’ev 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 156 KB