On a Diophantine inequality for forms of additive type
On a diophantine inequality involving prime numbers
On a diophantine problem with one prime, two squares of primes and s powers of two
On a Diophantine problem with two primes and s powers of two
On a limit point associated with the abc-conjecture
On a system of two diophantine inequalities with prime numbers
On a system of two diophantine inequalities with prime numbers
On a Theorem of S. Sivasankaranarayana Pillai
On arithmetic progressions having only few different prime factors in comparison with their length
On cubic Thue inequalities and a result of Mahler
On Davenport's bound for the degree of f³ - g² and Riemann's Existence Theorem
On Hall's conjecture
On indefinite diagonal forms in many variables.
On indefinite quadratic forms in four variables
On pairs of binary forms with given resultant or given semi-resultant.
On resultant inequalities
On simultaneous diagonal equations and inequalities
On the abc conjecture in algebraic number fields
On the difference between perfect powers
On the Frobenius number of a modular Diophantine inequality
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.