On the Frobenius number of a modular Diophantine inequality

Title:

On the Frobenius number of a modular Diophantine inequality

Creator:

Rosales, J. C. and Vasco, P.

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:922f6f7a-3877-4f14-9b07-c0977d7432b0
uuid:922f6f7a-3877-4f14-9b07-c0977d7432b0
doi:10.21136/MB.2008.140626

Subject:

numerical semigroup, Diophantine inequality, Frobenius number, and multiplicity

Type:

model:article and TEXT

Format:

bez média and svazek

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.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

367-375

Source:

Mathematica bohemica | 2008 Volume:133 | Number:4

Harvested from:

CDK

Metadata only:

false