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.

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.

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.

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.

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 similar documents to “A conjecture concerning the exponential diophantine equation a x + b y = c z

A note on ternary purely exponential diophantine equations

Yongzhong Hu, Maohua Le (2015)

Acta Arithmetica

Similarity:

Let a,b,c be fixed coprime positive integers with mina,b,c > 1, and let m = maxa,b,c. Using the Gel’fond-Baker method, we prove that all positive integer solutions (x,y,z) of the equation a x + b y = c z satisfy maxx,y,z < 155000(log m)³. Moreover, using that result, we prove that if a,b,c satisfy certain divisibility conditions and m is large enough, then the equation has at most one solution (x,y,z) with minx,y,z > 1.

A note on the exponential Diophantine equation ( 4 m ² + 1 ) x + ( 5 m ² - 1 ) y = ( 3 m ) z

Jianping Wang, Tingting Wang, Wenpeng Zhang (2015)

Colloquium Mathematicae

Similarity:

Let m be a positive integer. Using an upper bound for the solutions of generalized Ramanujan-Nagell equations given by Y. Bugeaud and T. N. Shorey, we prove that if 3 ∤ m, then the equation ( 4 m ² + 1 ) x + ( 5 m ² - 1 ) y = ( 3 m ) z has only the positive integer solution (x,y,z) = (1,1,2).

The Diophantine equation ( b n ) x + ( 2 n ) y = ( ( b + 2 ) n ) z

Min Tang, Quan-Hui Yang (2013)

Colloquium Mathematicae

Similarity:

Recently, Miyazaki and Togbé proved that for any fixed odd integer b ≥ 5 with b ≠ 89, the Diophantine equation b x + 2 y = ( b + 2 ) z has only the solution (x,y,z) = (1,1,1). We give an extension of this result.

On X 1 4 + 4 X 2 4 = X 3 8 + 4 X 4 8 and Y 1 4 = Y 2 4 + Y 3 4 + 4 Y 4 4

Susil Kumar Jena (2015)

Communications in Mathematics

Similarity:

The two related Diophantine equations: X 1 4 + 4 X 2 4 = X 3 8 + 4 X 4 8 and Y 1 4 = Y 2 4 + Y 3 4 + 4 Y 4 4 , have infinitely many nontrivial, primitive integral solutions. We give two parametric solutions, one for each of these equations.

Further remarks on Diophantine quintuples

Mihai Cipu (2015)

Acta Arithmetica

Similarity:

A set of m positive integers with the property that the product of any two of them is the predecessor of a perfect square is called a Diophantine m-tuple. Much work has been done attempting to prove that there exist no Diophantine quintuples. In this paper we give stringent conditions that should be met by a putative Diophantine quintuple. Among others, we show that any Diophantine quintuple a,b,c,d,e with a < b < c < d < e s a t i s f i e s d < 1.55·1072 a n d b < 6.21·1035 w h e n 4 a < b , w h i l e f o r b < 4 a o n e h a s e i t h e r c = a + b + 2√(ab+1)...

A note on the Diophantine equation P(z) = n! + m!

Maciej Gawron (2013)

Colloquium Mathematicae

Similarity:

We consider the Brocard-Ramanujan type Diophantine equation P(z) = n! + m!, where P is a polynomial with rational coefficients. We show that the ABC Conjecture implies that this equation has only finitely many integer solutions when d ≥ 2 and P ( z ) = a d z d + a d - 3 z d - 3 + + a x + a .

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