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 terms of the least common multiple
✍ Scribed by Marek Raczunas; Piotr Chrza̧stowski-Wachtel
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 414 KB
- Volume
- 150
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
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 coefficients except for the whole set of them. The reduction formula is expressed in terms of the least common multiple of the coefficients. For some classes of coefficients this formula gives an exact answer for the problem of Frobenius, and these classes are fully characterized in the paper.
📜 SIMILAR VOLUMES
A formulation of the extension of the method of Kutzelnigg and Klopper, to include terms that are linear in the interelectronic distances in the Ansatz for the wavefunction, to general multiple-reference CI (r,,-MR-Cl) with the same basis set requirements as in the closed-shell single reference case
The book by Bolza, in fact, became so popular that the fixed-endpoint problem we stated became known as the article no. 0162