𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for a linear diophantine equation and a problem of Frobenius

✍ Scribed by Harold Greenberg

Publisher
Springer-Verlag
Year
1980
Tongue
English
Weight
150 KB
Volume
34
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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