Related papers: On the Diophantine equation x^4-q^4=py^5
Let $p$ be a prime and $a$ a quadratic non-residue $\bmod p$. Then the set of integral solutions of the diophantine equation $x_0^2 - ax_1^2 -px_2^2 + apx_3^2=1$ form a cocompact discrete subgroup $\Gamma_{p,a}\subset SL(2,\mathbb{R})$ and…
In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the characterization of primitive divisors on…
Let $c$ be a square-free positive integer and $p$ a prime satisfying $p\nmid c$. Let $h(-c)$ denote the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-c})$. In this paper, we consider the Diophantine equation…
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 find non-negative integer solutions for exponential Diophantine equations of the type $p \cdot 3^x+ p^y=z^2,$ where $p$ is a prime number. We prove that such equation has a unique solution…
In this note we find all the solutions of the Diophantine equation $x^4\pm y^4=iz^2$ using elliptic curves over $\mathbb Q(i)$. Also, using the same method we give a new proof of Hilbert's result that the equation $x^4\pm y^4=z^2$ has only…
We report the fourth known primitive solution to the Diophantine equation $a^5 + b^5 + c^5 + d^5 = e^5$, extending the list of solutions from 1966, 1996, and 2004. This result was obtained via a large-scale computational search based on an…
In this paper we show that, for any fixed $1<c<967/805$, 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-N|<\varepsilon \end{equation*}…
In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers. Several illustrations…
Let $q$ be a prime. We classify the odd primes $p\neq q$ such that the equation $x^2\equiv q\pmod{p}$ has a solution, concretely, we find a subgroup $\mathbb{L}_{4q}$ of the multiplicative group $\mathbb{U}_{4q}$ of integers relatively…
Integer solutions of the diophantine equation $A^4+hB^4=C^4+hD^4$ are known for all positive integer values of $h < 1000$. While a solution of the aforementioned diophantine equation for any arbitrary positive integer value of $h$ is not…
Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that…
In this paper, we consider the exponential Diophantine equation $a^{x}+b^{y}=c^{z},$ where $a, b, c$ be relatively prime positive integers such that $a^{2}+b^{2}=c^{r}, r\in Z^{+}, 2\mid r$ with $b$ even. That is $$a=\mid…
In this paper we provide criteria for the insolvability of the Diophantine equation $x^2+D=y^n$. This result is then used to determine the class number of the quadratic field $\mathbb{Q}(\sqrt{-D})$. We also determine some criteria for the…
We give the complete solution in integers $(n,a,b,x,y)$ of the title equation when $\gcd(x,y)=1$, except for the case when $xab$ is odd.
The object of this paper is to give a new proof of all the solutions of the Diophantine equation x^2+11^m=y^n; in positive integers x, y with odd m>1 and n>=3.
The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…
Let l be an odd prime. For primes, p \equiv 1 (mod l), Gauss (l = 3) and Dickson (l = 5) considered the Diophantine systems in terms of which cyclotomic numbers of order 3 and 5 were obtained. The aim of this paper is to show how to obtain…
Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…
Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…