MATHEMATICA BOHEMICA, Vol. 133, No. 4, pp. 367-375 (2008)

On the Frobenius number of a modular
Diophantine inequality

J. C. Rosales, P. Vasco

J. C. Rosales, Departamento de Algebra, Universidad de Granada, E-18071 Granada, Spain, e-mail: jrosales@ugr.es; P. Vasco, Departamento de Matematica, Universidade de Tras-os-Montes e Alto Douro, 5001-801 Vila Real, Portugal, e-mail: pvasco@utad.pt

Abstract: We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality $ax \mod b\leq x$, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.

Keywords: numerical semigroup, Diophantine inequality, Frobenius number, multiplicity

Classification (MSC2000): 11D75, 20M14

Full text of the article:

[Previous Article] [Next Article] [Contents of this Number] [Journals Homepage]
© 2008–2010 FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition