Displaying 1061 – 1080 of 1461

Showing per page

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 x , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.

Currently displaying 1061 – 1080 of 1461