Related papers: On Diophantine quintuple Conjecture

The above equation is also called as Euler(6,2,5) system. By computational aspect these systems are very interesting. And we can also apply these methods to other Diophantine equations. We give a brief history of these systems and how we…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

In this paper we show that, for any fixed $1<c<\frac{5363}{3900}$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c+p_5^c-N|<\varepsilon…

Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…

In this paper, we proved that there are infinitely many integer solutions of $X^6 - Y^6 = W^n - Z^n,\ n=2,3,4$.

Let $1<c<37/18,\,c\neq2$ and $N$ be a sufficiently large real number. In this paper, we prove that, for almost all $R\in(N,2N],$ the Diophantine inequality $|p_1^c+p_2^c+p_3^c-R|<\log^{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3.$…

Given integers $a,b>1$ with $\log_b{a}$ irrational, we investigate the connection between the conjectured asymptotic equidistribution of digits in the base-$b$ expansion of $a^n$ and the (non-)Diophantine properties of the number…

We show that the decidability of an amplification of Hilbert's Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive…

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…

It is an old problem in the area of Diophantine definability to determine whether $\mathbb{Q}$ is Diophantine in $\mathbb{Q}(z)$. We provide a positive answer conditional on two standard conjectures on elliptic surfaces.

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many…

We show that there are only finitely many triples of integers $ 0 < a < b < c $ such that the product of any two of them is the value of a given polynomial with integer coefficients evaluated at an $ S $-unit that is also a positive…

Let $d$ be a square-free integer such that $d \equiv 15 \pmod{60}$ and the Pell's equation $x^2 - dy^2 = -6$ is solvable in rational integers $x$ and $y$. In this paper, we prove that there exist infinitely many Diophantine quadruples in…

We study the extensibility of $D(4)$-pairs $\{a,b\}$, where $b = ka$ and $k \in \{7,8,10,11,12,13\}$. Firstly, we show that it can be extended to a $D(4)$-triple with an element c, which is a member of a family of positive integers…

We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…

For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…

For a nonzero integer $n$, a set of distinct nonzero integers $\{a_1,a_2,\ldots,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1\leq i<j\leq m$, is called a Diophantine $m$-tuple with the property $D(n)$ or simply $D(n)$-set.…

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