Displaying similar documents to “The Diophantine equation y 2 = D x 4 + 1 , II”

The Diophantine equation D x ² + 2 2 m + 1 = y

J. H. E. Cohn (2003)

Colloquium Mathematicae

Similarity:

It is shown that for a given squarefree positive integer D, the equation of the title has no solutions in integers x > 0, m > 0, n ≥ 3 and y odd, nor unless D ≡ 14 (mod 16) in integers x > 0, m = 0, n ≥ 3, y > 0, provided in each case that n does not divide the class number of the imaginary quadratic field containing √(-2D), except for a small number of (stated) exceptions.

A ternary Diophantine inequality over primes

Roger Baker, Andreas Weingartner (2014)

Acta Arithmetica

Similarity:

Let 1 < c < 10/9. For large real numbers R > 0, and a small constant η > 0, the inequality | p c + p c + p c - R | < R - η holds for many prime triples. This improves work of Kumchev [Acta Arith. 89 (1999)].

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

Amir Khosravi, Behrooz Khosravi (2003)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

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 x 2 + 5 k 17 l = y n

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

Communications in Mathematics

Similarity:

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).

Method of infinite ascent applied on - ( 2 p · A 6 ) + B 3 = C 2

Susil Kumar Jena (2013)

Communications in Mathematics

Similarity:

In this paper, the author shows a technique of generating an infinite number of coprime integral solutions for ( A , B , C ) of the Diophantine equation - ( 2 p · A 6 ) + B 3 = C 2 for any positive integral values of p when p 1 (mod 6) or p 2 (mod 6). For doing this, we will be using a published result of this author in The Mathematics Student, a periodical of the Indian Mathematical Society.

The method of infinite ascent applied on A 4 ± n B 3 = C 2

Susil Kumar Jena (2013)

Czechoslovak Mathematical Journal

Similarity:

Each of the Diophantine equations A 4 ± n B 3 = C 2 has an infinite number of integral solutions ( A , B , C ) for any positive integer n . In this paper, we will show how the method of infinite ascent could be applied to generate these solutions. We will investigate the conditions when A , B and C are pair-wise co-prime. As a side result of this investigation, we will show a method of generating an infinite number of co-prime integral solutions ( A , B , C ) of the Diophantine equation a A 3 + c B 3 = C 2 for any co-prime integer pair ( a , c ) . ...

A note on the number of S -Diophantine quadruples

Florian Luca, Volker Ziegler (2014)

Communications in Mathematics

Similarity:

Let ( a 1 , , a m ) be an m -tuple of positive, pairwise distinct integers. If for all 1 i < j m the prime divisors of a i a j + 1 come from the same fixed set S , then we call the m -tuple S -Diophantine. In this note we estimate the number of S -Diophantine quadruples in terms of | S | = r .