Displaying 861 – 880 of 1560

Showing per page

On the exponential diophantine equation x y + y x = z z

Xiaoying Du (2017)

Czechoslovak Mathematical Journal

For any positive integer D which is not a square, let ( u 1 , v 1 ) be the least positive integer solution of the Pell equation u 2 - D v 2 = 1 , and let h ( 4 D ) denote the class number of binary quadratic primitive forms of discriminant 4 D . If D satisfies 2 D and v 1 h ( 4 D ) 0 ( mod D ) , then D is called a singular number. In this paper, we prove that if ( x , y , z ) is a positive integer solution of the equation x y + y x = z z with 2 z , then maximum max { x , y , z } < 480000 and both x , y are singular numbers. Thus, one can possibly prove that the equation has no positive integer solutions ( x , y , z ) .

On the exponential local-global principle

Boris Bartolome, Yuri Bilu, Florian Luca (2013)

Acta Arithmetica

Skolem conjectured that the "power sum" A(n) = λ₁α₁ⁿ + ⋯ + λₘαₘⁿ satisfies a certain local-global principle. We prove this conjecture in the case when the multiplicative group generated by α₁,...,αₘ is of rank 1.

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.

Currently displaying 861 – 880 of 1560