𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The diophantine problem of Frobenius: A close bound

✍ Scribed by Hugo Krawczyk; Azaria Paz

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
183 KB
Volume
23
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 a Linear Diophantine Problem of Frobe
On a Linear Diophantine Problem of Frobenius: Extending the Basis
✍ Stefan Matthias Ritter πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 233 KB

Let X k =[a 1 , a 2 , ..., a k ], k>1, be a subset of N such that gcd(X k )=1. We shall say that a natural number n is dependent (on X k ) if there are nonnegative integers x i such that n has a representation n= k i=1 x i a i , else independent. The Frobenius number g(X k ) of X k is the greatest i

A Diophantine problem of Frobenius in te
A Diophantine problem of Frobenius in terms of the least common multiple
✍ Marek Raczunas; Piotr ChrzaΜ§stowski-Wachtel πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 414 KB

The Diophantine Problem of Frobenius is to find a formula for the least integer not representable as a nonnegative linear form of positive integers. A reduction formula for the Diophantine Problem of Frobenius is presented. The formula can be applied whenever there are common divisors of the coeffic