Solutions to xyz = 1 and x+y+z = k in algebraic integers of small degree, I

H. G. Grundman; L. L. Hall-Seelig

Displaying similar documents to “Solutions to xyz = 1 and x+y+z = k in algebraic integers of small degree, I”

Solutions to xyz = 1 and x + y + z = k in algebraic integers of small degree, II

H. G. Grundman, L. L. Hall-Seelig (2015)

Acta Arithmetica

Similarity:

Let k ∈ ℤ be such that $|_{k} (ℚ) |$ is finite, where $_{k} : y ² = 1 - 2 k x + k ² x ² - 4 x ³$ . We complete the determination of all solutions to xyz = 1 and x + y + z = k in integers of number fields of degree at most four over ℚ.

A note on the article by F. Luca “On the system of Diophantine equations $a ² + b ² = {(m ² + 1)}^{r}$ and $a^{x} + b^{y} = {(m ² + 1)}^{z}$ ” (Acta Arith. 153 (2012), 373-392)

Takafumi Miyazaki (2014)

Acta Arithmetica

Similarity:

Let r,m be positive integers with r > 1, m even, and A,B be integers satisfying $A + B \sqrt (- 1) = {(m + \sqrt (- 1))}^{r}$ . We prove that the Diophantine equation ${| A |}^{x} + {| B |}^{y} = {(m ² + 1)}^{z}$ has no positive integer solutions in (x,y,z) other than (x,y,z) = (2,2,r), whenever $r > 10^{74}$ or $m > 10^{34}$ . Our result is an explicit refinement of a theorem due to F. Luca.

Diophantine equations involving factorials

Horst Alzer, Florian Luca (2017)

Mathematica Bohemica

Similarity:

We study the Diophantine equations ${(k!)}^{n} - k^{n} = {(n!)}^{k} - n^{k}$ and ${(k!)}^{n} + k^{n} = {(n!)}^{k} + n^{k},$ where $k$ and $n$ are positive integers. We show that the first one holds if and only if $k = n$ or $(k, n) = (1, 2), (2, 1)$ and that the second one holds if and only if $k = n$ .

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

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.

Diophantine approximations with Fibonacci numbers

Victoria Zhuravleva (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $F_{n}$ be the $n$ -th Fibonacci number. Put $ϕ = \frac{1 + \sqrt{5}}{2}$ . We prove that the following inequalities hold for any real $α$ : 1) ${inf}_{n \in ℕ} | | F_{n} α | | \leq \frac{ϕ - 1}{ϕ + 2}$ , 2) ${lim inf}_{n \to \infty} | | F_{n} α | | \leq \frac{1}{5}$ , 3) ${lim inf}_{n \to \infty} | | ϕ^{n} α | | \leq \frac{1}{5}$ . These results are the best possible.

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.

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

An $a b c d$ theorem over function fields and applications

Pietro Corvaja, Umberto Zannier (2011)

Bulletin de la Société Mathématique de France

Similarity:

We provide a lower bound for the number of distinct zeros of a sum $1 + u + v$ for two rational functions $u, v$ , in term of the degree of $u, v$ , which is sharp whenever $u, v$ have few distinct zeros and poles compared to their degree. This sharpens the “ $a b c d$ -theorem” of Brownawell-Masser and Voloch in some cases which are sufficient to obtain new finiteness results on diophantine equations over function fields. For instance, we show that the Fermat-type surface $x^{a} + y^{a} + z^{c} = 1$ contains only finitely many rational or elliptic...

The number of solutions to the generalized Pillai equation $\pm r a^{x} \pm s b^{y} = c$ .

Reese Scott, Robert Styer (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We consider $N$ , the number of solutions $(x, y, u, v)$ to the equation ${(- 1)}^{u} r a^{x} + {(- 1)}^{v} s b^{y} = c$ in nonnegative integers $x, y$ and integers $u, v \in {0, 1}$ , for given integers $a > 1$ , $b > 1$ , $c > 0$ , $r > 0$ and $s > 0$ . When $gcd (r a, s b) = 1$ , we show that $N \leq 3$ except for a finite number of cases all of which satisfy $max (a, b, r, s, x, y) < 2 \cdot 10^{15}$ for each solution; when $gcd (a, b) > 1$ , we show that $N \leq 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving $N = 3$ solutions.

A note on the weighted Khintchine-Groshev Theorem

Mumtaz Hussain, Tatiana Yusupova (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $W (m, n; \underset{̲}{ψ})$ denote the set of $ψ_{1}, ..., ψ_{n}$ –approximable points in $ℝ^{m n}$ . The classical Khintchine–Groshev theorem assumes a monotonicity condition on the approximating functions $\underset{̲}{ψ}$ . Removing monotonicity from the Khintchine–Groshev theorem is attributed to different authors for different cases of $m$ and $n$ . It can not be removed for $m = n = 1$ as Duffin–Schaeffer provided the counter example. We deal with the only remaining case $m = 2$ and thereby remove all unnecessary conditions from the Khintchine–Groshev theorem. ...

Multiplicatively dependent triples of Tribonacci numbers

Carlos Alexis Ruiz Gómez, Florian Luca (2015)

Acta Arithmetica

Similarity:

We consider the Tribonacci sequence $T : = {T_{n}}_{n \geq 0}$ given by T₀ = 0, T₁ = T₂ = 1 and $T_{n + 3} = T_{n + 2} + T_{n + 1} + T_{n}$ for all n ≥ 0, and we find all triples of Tribonacci numbers which are multiplicatively dependent.

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.