Displaying 861 – 880 of 1554

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.

On the generalized Fermat equation over totally real fields

Heline Deconinck (2016)

Acta Arithmetica

In a recent paper, Freitas and Siksek proved an asymptotic version of Fermat’s Last Theorem for many totally real fields. We prove an extension of their result to generalized Fermat equations of the form A x p + B y p + C z p = 0 , where A, B, C are odd integers belonging to a totally real field.

On the integer solutions of exponential equations in function fields

Umberto Zannier (2004)

Annales de l’institut Fourier

This paper is concerned with the estimation of the number of integer solutions to exponential equations in several variables, over function fields. We develop a method which sometimes allows to replace known exponential bounds with polynomial ones. More generally, we prove a counting result (Thm. 1) on the integer points where given exponential terms become linearly dependent over the constant field. Several applications are given to equations (Cor. 1) and to the estimation of the number of equal...

Currently displaying 861 – 880 of 1554