On a Linear Diophantine Problem
โ Scribed by Lewin, M.
- Book ID
- 111955045
- Publisher
- Oxford University Press
- Year
- 1973
- Tongue
- English
- Weight
- 198 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0024-6093
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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