Displaying similar documents to “On the Frobenius number of a proportionally modular Diophantine inequality.”

On the Frobenius number of a modular Diophantine inequality

José Carlos Rosales, P. Vasco (2008)

Mathematica Bohemica

Similarity:

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.

On the diophantine equation w+x+y = z, with wxyz = 2 3 5.

L. J. Alex, L. L. Foster (1995)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

In this paper we complete the solution to the equation w+x+y = z, where w, x, y, and z are positive integers and wxyz has the form 2 3 5, with r, s, and t non negative integers. Here we consider the case 1 < w ≤ x ≤ y, the remaining case having been dealt with in our paper: On the Diophantine equation 1+ X + Y = Z, This work extends earlier work of the authors in the field of exponential Diophantine equations.