On a linear Diophantine problem of Frobenius.
On a linear Diophantine problem of Frobenius. II.
On the Frobenius number of a modular Diophantine inequality
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
On the Frobenius number of a proportionally modular Diophantine inequality.
On the Frobenius number of Fibonacci numerical semigroups.
On the Frobenius number of some Lucas numerical semigroups.
On the Frobenius problem for .
On the limit distribution of Frobenius numbers