The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 1801 – 1820 of 3028

Showing per page

On the Diophantine equation j = 1 k j F j p = F n q

Gökhan Soydan, László Németh, László Szalay (2018)

Archivum Mathematicum

Let F n denote the n t h term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation F 1 p + 2 F 2 p + + k F k p = F n q in the positive integers k and n , where p and q are given positive integers. A complete solution is given if the exponents are included in the set { 1 , 2 } . Based on the specific cases we could solve, and a computer search with p , q , k 100 we conjecture that beside the trivial solutions only F 8 = F 1 + 2 F 2 + 3 F 3 + 4 F 4 , F 4 2 = F 1 + 2 F 2 + 3 F 3 , and F 4 3 = F 1 3 + 2 F 2 3 + 3 F 3 3 satisfy the title equation.

On the Diophantine equation q n - 1 q - 1 = y

Amir Khosravi, Behrooz Khosravi (2003)

Commentationes Mathematicae Universitatis Carolinae

There exist many results about the Diophantine equation ( q n - 1 ) / ( q - 1 ) = y m , where m 2 and n 3 . In this paper, we suppose that m = 1 , n is an odd integer and q a power of a prime number. Also let y be an integer such that the number of prime divisors of y - 1 is less than or equal to 3 . Then we solve completely the Diophantine equation ( q n - 1 ) / ( q - 1 ) = y for infinitely many values of y . This result finds frequent applications in the theory of finite groups.

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

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

Revista Matemática de la Universidad Complutense de Madrid

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 2r 3s 5t, 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, Rocky Mountain J. of Math. This work extends earlier work of the authors in the field of exponential Diophantine equations.

On the diophantine equation x 2 + 2 a 3 b 73 c = y n

Murat Alan, Mustafa Aydin (2023)

Archivum Mathematicum

In this paper, we find all integer solutions ( x , y , n , a , b , c ) of the equation in the title for non-negative integers a , b and c under the condition that the integers x and y are relatively prime and n 3 . The proof depends on the famous primitive divisor theorem due to Bilu, Hanrot and Voutier and the computational techniques on some elliptic curves.

On the Diophantine equation x 2 + 2 α 5 β 17 γ = y n

Hemar Godinho, Diego Marques, Alain Togbé (2012)

Communications in Mathematics

In this paper, we find all solutions of the Diophantine equation x 2 + 2 α 5 β 17 γ = y n in positive integers x , y 1 , α , β , γ , n 3 with gcd ( x , y ) = 1 .

On the diophantine equation x 2 + 5 k 17 l = y n

István Pink, Zsolt Rábai (2011)

Communications in Mathematics

Consider the equation in the title in unknown integers ( x , y , k , l , n ) with x 1 , y > 1 , n 3 , k 0 , l 0 and gcd ( x , y ) = 1 . Under the above conditions we give all solutions of the title equation (see Theorem 1).

Currently displaying 1801 – 1820 of 3028