Displaying 1781 – 1800 of 3014

Showing per page

On the diophantine equation f(x)f(y) = f(z)²

Maciej Ulas (2007)

Colloquium Mathematicae

Let f ∈ ℚ [X] and deg f ≤ 3. We prove that if deg f = 2, then the diophantine equation f(x)f(y) = f(z)² has infinitely many nontrivial solutions in ℚ (t). In the case when deg f = 3 and f(X) = X(X²+aX+b) we show that for all but finitely many a,b ∈ ℤ satisfying ab ≠ 0 and additionally, if p|a, then p²∤b, the equation f(x)f(y) = f(z)² has infinitely many nontrivial solutions in rationals.

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.

Currently displaying 1781 – 1800 of 3014