Related papers: There is no Diophantine quintuple

In this note we consider the title Diophantine equation from both theoretical as well as experimental point of view. In particular, we prove that for $k=4, 6$ and each choice of the signs our equation has infinitely many co-prime positive…

We study the Folklore set of Dirichlet improvable matrices in $\mathbb R^{m\times n}$ which are neither singular nor badly approximable. We prove the non-emptiness for all positive integer pairs $m,n$ apart from $\{m,n\}=\{ 1,1\}$ and…

Suppose that $x$ is odd, $n\geq7$ and $p\notin\{2,5\}$ are primes. In this paper, we prove that the Diophantine equations $x^{2}\pm5^{\alpha}p^{n}=y^{n}$ have no solutions in positive integers $\alpha,x,y$ with $gcd(x,y)=1$.

In this paper, we study the diophantine equation ${{\sigma }_{2}}(n)-{{n}^{2}}=An+B$. We prove that except for finitely many computable solutions, all the solutions to this equation with $(A,B)=({{L}_{2m}},F_{2m}^{2}-1)$ are…

In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…

According to Skolem's conjecture, if an exponential Diophantine equation is not solvable, then it is not solvable modulo an appropriately chosen modulus. Besides several concrete equations, the conjecture has only been proved for rather…

The aim of this paper is to consider the extensibility of the Diophantine triple $\{2,b,c\}$, where $2<b<c$, and to prove that such a set cannot be extended to an irregular Diophantine quadruple. We succeed in that for some families of…

By following the same construction pattern which Martin Davis proposed in a 1968 paper of his, we have obtained six quaternary quartic Diophantine equations that candidate as `rule-them-all' equations: proving that one of them has only a…

Let $(a,b,c)$ be a primitive Pythagorean triple. Set $a=m^2-n^2$,$b=2mn$, and $c=m^2+n^2$ with $m$ and $n$ positive coprime integers, $m>n $ and $ m \not \equiv n \pmod 2$. A famous conjecture of Je\'{s}manowicz asserts that the only…

For an arbitrary integer $x$, an integer of the form $T(x)=\frac{x^2+x}{2}$ is called a triangular number. For positive integers $\alpha_1,\alpha_2,\dots,\alpha_k$, a sum…

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

Let $S := \{p_1,\ldots ,p_{\ell}\}$ be a finite set of primes and denote by $\mathcal{U}_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order…

Except for a limited number of cases, a complete classification of the Diophantine sets of polynomial rings and fields of rational functions seems out of reach at present. We contribute to this problem by proving that several natural sets…

Let x be a real number and let n be a positive integer. We define four exponents of Diophantine approximation, which complement the exponents w_n(x) and w_n^*(x) defined by Mahler and Koksma. We calculate their six values when n=2 and x is…

In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in…

We study Liouville-type theorem for polyharmonic H\'enon-Lane-Emden system $(-\Delta)^mu=|x|^av^p,\; (-\Delta)^mv=|x|^bu^q$ when $m,p,q\geq 1, pq\ne 1$, and $a,b\geq 0$. It is a natural conjecture that the nonexistence of positive solutions…

Let $B_k$ denote the $k^{th}$ term of balancing sequence. In this paper we find all positive integer solutions of the Diophantine equation $B_n+B_m = x^q$ in variables $(m, n,x,q)$ under the assumption $n\equiv m \pmod 2$. Furthermore, we…

We show that if {1, b, c, d} is a D(-1) diophantine quadruple with b<c<d and c=1+s^2, then the cases s=p^k, s=2p^k, c=p and c=2p^k do not occur, where p is an odd prime and k is a positive integer. For the integer d=1+x^2, we show that it…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…