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 (MSC 2000): 11D75, 20M14
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
