Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 1 of 1

Order by Relevance | Title | Year of publication

On the Frobenius number of a modular Diophantine inequality

José Carlos Rosales; P. Vasco — 2008

Mathematica Bohemica

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

Page 1

Download Results (CSV)