Related papers: A subset of Z^n whose non-computability leads to t…

Let $(U_n)_{n\in \mathbb{N}}$ be a fixed linear recurrence sequence defined over the integers (with some technical restrictions). We prove that there exist effectively computable constants $B$ and $N_0$ such that for any $b,c\in \mathbb{Z}$…

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositions of polynomial sequences. In particular, they showed that when $k \geq 3$, each infinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicatively irreducible.…

In this paper, we solve the simultaneous Diophantine equations m.(x_1^k+....+x_{t_1}^k)=n.(y_1^k+....+y_{t_2}^k); k=1,3, where t_1, t_2>3, and m, n are fixed arbitrary and relatively prime positive integers. This is done by choosing two…

In this paper we deal with a non-linear Diophantine equation which arises from the determinant computation of an integer matrix. We show how to find a solution, when it exists. We define an equivalence relation and show how the set of all…

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

Let $\alpha$ be an algebraic number of degree $d\ge 3$ and let $K$ be the algebraic number field $\Q(\alpha)$. When $\varepsilon$ is a unit of $K$ such that $\Q(\alpha\varepsilon)=K$, we consider the irreducible polynomial $f_\varepsilon(X)…

In this paper we obtain three undecidable results for exponential diophantine equations over the field $\mathbb Q$ of rational numbers. For example, we prove that there is no algorithm to decide the solvability of a general exponential…

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…

The height of a rational number $p/q$ is denoted by $h(p/q)$ and equals $\text{max}(|p|,|q|)$ provided p/q is written in lowest terms. The height of a rational tuple $(x_1,...,x_n)$ is denoted by $h(x_1,...,x_n)$ and equals…

Let $\alpha$ be an algebraic number of degree $d\ge 3$ having at most one real conjugate and let $K$ be the algebraic number field ${\mathbf Q}(\alpha)$. For any unit $\epsilon$ of $K$ such that ${\mathbf Q}(\alpha\epsilon)=K$, we consider…

In this paper, we solve the simultaneous Diophantine equations(SDE) x_1^u+...+x_n^u=k(y_1^u+...+y_{n/k}); u=1,3, where n >3, and k< n, is a divisor of n , and obtain nontrivial parametric solution for them. Furthermore we present a method…

Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smory\'nski's theorem states that the set of all Diophantine equations which have at most…

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

Let $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w…

Here, we find all positive integer solutions of the Diophantine equation in the title, where $(\mathcal{U}_n)_{n\geqslant 0}$ is the generalized Lucas sequence $\mathcal{U}_0=0, \ \mathcal{U}_1=1$ and $\mathcal{U}_{n+1}=r \mathcal{U}_n +s…

Let $k\geq 2$ and $n\neq 0$. A Diophantine tuple with property $D_k(n)$ is a set of positive integers $A$ such that $ab+n$ is a $k$-th power for all $a,b\in A$ with $a\neq b$. Such generalizations of classical Diophantine tuples have been…

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…