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

Jianping Wang; Tingting Wang; Wenpeng Zhang

Displaying similar documents to “A note on the exponential Diophantine equation ${(4 m ² + 1)}^{x} + {(5 m ² - 1)}^{y} = {(3 m)}^{z}$ ”

On the system of Diophantine equations $a^{2} + b^{2} = {(m^{2} + 1)}^{r}$ and $a^{x} + b^{y} = {(m^{2} + 1)}^{z}$

Florian Luca (2012)

Acta Arithmetica

Similarity:

On the Diophantine equation $x ² + 2^{α} 13^{β} = y ⁿ$

Florian Luca, Alain Togbé (2009)

Colloquium Mathematicae

Similarity:

We find all the solutions of the Diophantine equation $x ² + 2^{α} 13^{β} = y ⁿ$ in positive integers x,y,α,β,n ≥ 3 with x and y coprime.

On the diophantine equations $\prod_{0}^{k} x_{i} - \sum_{0}^{k} x_{i} = n a n d \sum_{0}^{k} 1 / x_{i} = a / n$

Carlo Viola (1973)

Acta Arithmetica

Similarity:

The diophantine equation $x^{2} = p^{a} \pm p^{b} + 1$

Florian Luca (2004)

Acta Arithmetica

Similarity:

Corrigendum to the paper “A note on the Diophantine equation $x^{2} + q^{m} = y^{3}$ ” (Acta Arith. 146 (2011), 195-202)

H. L. Zhu (2012)

Acta Arithmetica

Similarity:

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.

On the Lebesgue-Nagell equation

Andrzej Dąbrowski (2011)

Colloquium Mathematicae

Similarity:

We completely solve the Diophantine equations $x ² + 2^{a} q^{b} = y ⁿ$ (for q = 17, 29, 41). We also determine all $C = p ₁^{a ₁} \dots p_{k}^{a_{k}}$ and $C = 2^{a ₀} p ₁^{a ₁} \dots p_{k}^{a_{k}}$ , where $p ₁, . . ., p_{k}$ are fixed primes satisfying certain conditions. The corresponding Diophantine equations x² + C = yⁿ may be studied by the method used by Abu Muriefah et al. (2008) and Luca and Togbé (2009).

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

Multiplicative relations on binary recurrences

Florian Luca, Volker Ziegler (2013)

Acta Arithmetica

Similarity:

Given a binary recurrence ${u_{n}}_{n \geq 0}$ , we consider the Diophantine equation $u_{n_{1}}^{x_{1}} \dots u_{n_{L}}^{x_{L}} = 1$ with nonnegative integer unknowns $n_{1}, . . ., n_{L}$ , where $n_{i} \neq n_{j}$ for 1 ≤ i < j ≤ L, $m a x | x_{i} | : 1 \leq i \leq L \leq K$ , and K is a fixed parameter. We show that the above equation has only finitely many solutions and the largest one can be explicitly bounded. We demonstrate the strength of our method by completely solving a particular Diophantine equation of the above form.

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.

The diophantine equation $x^{2} + C = y^{n}$ , II

J. H. E. Cohn (2003)

Acta Arithmetica

Similarity:

On the diophantine equation $x^{y} - y^{x} = c^{z}$

Zhongfeng Zhang, Jiagui Luo, Pingzhi Yuan (2012)

Colloquium Mathematicae

Similarity:

Applying results on linear forms in p-adic logarithms, we prove that if (x,y,z) is a positive integer solution to the equation $x^{y} - y^{x} = c^{z}$ with gcd(x,y) = 1 then (x,y,z) = (2,1,k), (3,2,k), k ≥ 1 if c = 1, and either $(x, y, z) = (c^{k} + 1, 1, k)$ , k ≥ 1 or $2 \leq x < y \leq m a x 1.5 \times 10^{10}, c$ if c ≥ 2.

A note on the Diophantine equation $(a^{n} x^{m} \pm 1) / (a^{n} x \pm 1) = y^{n} + 1$

Jiagui Luo (2001)

Acta Arithmetica

Similarity:

On the Diophantine equation $x^{2} + q^{2 m} = 2 y^{p}$

Sz. Tengely (2007)

Acta Arithmetica

Similarity:

A note on the Diophantine equation $x^{2} + q^{m} = y^{3}$

Hui Lin Zhu (2011)

Acta Arithmetica

Similarity:

On the equation $n (n + d) \dots (n + (i ₀ - 1) d) (n + (i ₀ + 1) d) \dots (n + (k - 1) d) = y^{l}$ with 0 < i₀ < k-1

N. Saradha, T. N. Shorey (2007)

Acta Arithmetica

Similarity:

On systems of diophantine equations with a large number of solutions

Jerzy Browkin (2010)

Colloquium Mathematicae

Similarity:

We consider systems of equations of the form $x_{i} + x_{j} = x_{k}$ and $x_{i} \cdot x_{j} = x_{k}$ , which have finitely many integer solutions, proposed by A. Tyszka. For such a system we construct a slightly larger one with much more solutions than the given one.

Finiteness results for Diophantine triples with repdigit values

Attila Bérczes, Florian Luca, István Pink, Volker Ziegler (2016)

Acta Arithmetica

Similarity:

Let g ≥ 2 be an integer and $_{g} \subset ℕ$ be the set of repdigits in base g. Let $_{g}$ be the set of Diophantine triples with values in $_{g}$ ; that is, $_{g}$ is the set of all triples (a,b,c) ∈ ℕ³ with c < b < a such that ab + 1, ac + 1 and bc + 1 lie in the set $_{g}$ . We prove effective finiteness results for the set $_{g}$ .

Displaying similar documents to “A note on the exponential Diophantine equation ( 4 m ² + 1 ) x + ( 5 m ² - 1 ) y = ( 3 m ) z ”

Displaying similar documents to “A note on the exponential Diophantine equation ${(4 m ² + 1)}^{x} + {(5 m ² - 1)}^{y} = {(3 m)}^{z}$ ”