๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A graph-theoretic algorithm for the solution of a linear diophantine problem of frobenius

โœ Scribed by B. R. Heap; M. S. Lynn

Publisher
Springer-Verlag
Year
1964
Tongue
English
Weight
423 KB
Volume
6
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
โœ G.R. Hofmeister; A.M. Ibrahim; G.A. Shadia ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB
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