Related papers: Polynomial $D(4)$-quadruples over Gaussian Integer…

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

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

A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…

Consider the integral polynomials $f_{a,b}(x)=x^4+ax+b$ and $g_{c,d}(x)=x^4+cx^3+d$. Suppose $f_{a,b}(x)$ and $g_{c,d}(x)$ are irreducible, $b\mid a$, and the integers $b$, $d$, $256d-27c^4$, and $\dfrac{256b^3-27a^4}{\gcd(256b^3,27a^4)}$…

Given an equilateral triangle with $a$ the square of its side length and a point in its plane with $b$, $c$, $d$ the squares of the distances from the point to the vertices of the triangle, it can be computed that $a$, $b$, $c$, $d$ satisfy…

Let $d\equiv 2\pmod 4$ be a square-free integer such that $x^2 - dy^2 =- 1$ and $x^2 - dy^2 = 6$ are solvable in integers. We prove the existence of infinitely many quadruples in $\mathbb{Z}[\sqrt{d}]$ with the property $D(n)$ when $n \in…

A linear Diophantine equation $ax + by = n$ is solvable if and only if gcd$(a; b)$ divides $n$. A graph $G$ of order $n$ is called Diophantine if there exists a labeling function $f$ of vertices such that gcd$(f(u); f(v))$ divides $n$ for…

In this paper we mainly study sums of four rational squares with certain restrictions. Let $\mathbb Q_{\ge0}$ be the set of nonnegative rational numbers. We establish the following four-square theorem for rational numbers: For any…

By Descartes' rule of signs, a real degree $d$ polynomial $P$ with all nonvanishing coefficients, with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$) has $pos\leq c$ positive and $neg\leq p$…

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

Let $P(X)\in\mathbb{Z}[X]$ be an irreducible, monic, quartic polynomial with cyclic or dihedral Galois group. We prove that there exists a constant $c_P>0$ such that for a positive proportion of integers $n$, $P(n)$ has a prime factor $\ge…

Fix a number field k. We prove that k* - k*^2 is diophantine over k. This is deduced from a theorem that for a nonconstant separable polynomial P(x) in k[x], there are at most finitely many a in k* modulo squares such that there is a…

In this note, we prove that if $\{a,b,c,d,e\}$ with $a<b<c<d<e$ is a Diophantine quintuple, then $d<10^{76}$.

We consider the problem of finding 4 rational squares, such that the product of any two plus the sum of the same two always gives a square. We give some historical background and exhibit one such quadruple.

The Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been investigated by some authors. Currently, by computer search, the integer solutions of this equation are known for all positive integer…

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

This paper gives parametric solutions to quartic equations of the type,(4-3-3),(4-4-4),(4-5-5) and (4-6-6), According to Lander, Parkin, and Selfridge (2) conjecture, there are non-trivial solutions of the quartic…

Even though four theorems are actually proved in this paper, two are the main ones,Teorems 1 and 3. In Theorem 1 we show that if a and be are odd squarefree positive integers satisfying certain quadratic residue conditions; then there…

In this paper, we prove that the equation $x^2-(p^{2k+2}+1)y^2=-p^{2l+1}$, $l \in \{0,1,\dots,k\}, k \geq 0$, where $p$ is an odd prime number, is not solvable in positive integers $x$ and $y$. By combining that result with other known…

A Pythagorean n-tuple is an integer solution of x_1^2+...+x_{n-1}^2=x_n^2. For n=4 and n=6, the Pythagorean n-tuples admit a parametrization by a single n-tuple of polynomials with integer coefficients (which is impossible for n=3). For…