Further remarks on Diophantine quintuples

Mihai Cipu

Displaying similar documents to “Further remarks on Diophantine quintuples”

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.

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

Florian Luca (2004)

Acta Arithmetica

Similarity:

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:

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.

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:

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 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:

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.

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

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

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

A. Rotkiewicz, A. Schinzel (1987)

Colloquium Mathematicae

Similarity:

Diophantine equations and class number of imaginary quadratic fields

Zhenfu Cao, Xiaolei Dong (2000)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let A, D, K, k ∈ ℕ with D square free and 2 ∤ k,B = 1,2 or 4 and $μ_{i} \in - 1, 1 (i = 1, 2)$ , and let $h (- 2^{1 - e} D) (e = 0 o r 1)$ denote the class number of the imaginary quadratic field $ℚ (\sqrt (- 2^{1 - e} D))$ . In this paper, we give the all-positive integer solutions of the Diophantine equation Ax² + μ₁B = K((Ay² + μ₂B)/K)ⁿ, 2 ∤ n, n > 1 and we prove that if D > 1, then $h (- 2^{1 - e} D) \equiv 0 (m o d n)$ , where D, and n satisfy $k ⁿ - 2^{e + 1} = D x ²$ , x ∈ ℕ, 2 ∤ n, n > 1. The results are valuable for the realization of quadratic field cryptosystem.

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}$ .

The Diophantine Equation X³ = u+v over Real Quadratic Fields

Takaaki Kagawa (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

Let k be a real quadratic field and let $_{k}$ and $_{k}^{\times}$ be the ring of integers and the group of units, respectively. A method of solving the Diophantine equation X³ = u+v ( $X \in_{k}$ , $u, v \in_{k}^{\times}$ ) is developed.

Inhomogeneous Diophantine approximation with general error functions

Lingmin Liao, Michał Rams (2013)

Acta Arithmetica

Similarity:

Let α be an irrational and φ: ℕ → ℝ⁺ be a function decreasing to zero. Let $ω (α) : = s u p θ \geq 1 : l i m i n f_{n \to \infty} n^{θ} | | n α | = 0$ $. F o r a n y α w i t h a g i v e n ω (α), w e g i v e s o m e s h a r p e s t i m a t e s f o r t h e H a u s d o r f f d i m e n s i o n o f t h e s e t$ $E_{φ} (α)$ := y ∈ ℝ: ||nα -y|| < φ(n) for infinitely many n, where ||·|| denotes the distance to the nearest integer.

Diophantine triples with values in binary recurrences

Clemens Fuchs, Florian Luca, Laszlo Szalay (2008)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

In this paper, we study triples $a, b$ and $c$ of distinct positive integers such that $a b + 1, a c + 1$ and $b c + 1$ are all three members of the same binary recurrence sequence.

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.

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.