Search

Start Over Subject Diophantine inequality

1. On the Frobenius number of a modular Diophantine inequality

Creator:
Rosales, J. C. and Vasco, P.
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
numerical semigroup, Diophantine inequality, Frobenius number, and multiplicity
Language:
English
Description:
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b ≤ x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

Limit your search