Related papers: Handling some Diophantine equation via Euclidean a…

We prove that the Diophantine equation (a^2 c x^k - 1)(b^2 c y^k - 1) = (abc z^k - 1)^2 has no solutions in positive integers with x, y, z > 1, k \geq 7 and a^2x^k \neq b^2y^k.

In a 2011 paper published in the journal "Asian Journal of Algebra"(see reference[1]), the authors consider, among other equations,the diophantine equations 2xy=n(x+y) and 3xy=n(x+y). For the first equation, with n being an odd positive…

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…

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…

In this paper, we use the method of Thue and Siegel, based on explicit Pade approximations to algebraic functions, to completely solve a family of quartic Thue equations. From this result, we can also solve the diophantine equation in the…

In this note, we find all the solutions of the Diophantine equation x^2 +2^a.3^b.11^c=y^n in nonnegative integers a, b, c, x, y, n>= 3 with x and y coprime.

In this paper, we obtain new results on the integers solutions X, Y, Z of the diophantine equation X^t+Y^t=BZ^t for a rationnal integer B and a prime number t verifying some conditions explained in the paper.

Let $F \in \mathbb Z[x, y]$ be an irreducible binary form of degree $d \geq 7$ and content one. Let $\alpha$ be a root of $F(x, 1)$ and assume that the field extension $\mathbb Q(\alpha)/\mathbb Q$ is Galois. We prove that, for every…

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.

We study the exponential Diophantine equation $x^2+p^mq^n=2y^p$ in positive integers $x,y,m,n$, and odd primes $p$ and $q$ using primitive divisors of Lehmer sequences in combination with elementary number theory. We discuss the solvability…

Let $\{ {U_{n}\}_{n \geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\{p_1,\ldots, p_s\}$ be fixed prime numbers and $\{b_1,\ldots ,b_s\}$ be fixed non-negative integers. In this paper, we obtain…

For any fixed coprime positive integers $a,b$ and $c$ with $\min\{a,b,c\}>1$, we prove that the equation $a^x+b^y=c^z$ has at most two solutions in positive integers $x,y$ and $z$, except for one specific case which exactly gives three…

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…

This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…

Stiller proved that the Diophantine equation $x^2+119=15\cdot 2^{n}$ has exactly six solutions in positive integers. Motivated by this result we are interested in constructions of Diophantine equations of Ramanujan-Nagell type…

Let $\varepsilon>0$ be a small constant. In the present paper we prove that whenever $\eta$ is real and constants $\lambda _i$ satisfy some necessary conditions, then there exist infinitely many prime triples $p_1,\, p_2,\, p_3$ satisfying…

In this paper, we summarize the work on ternary Diophantine equation of the form $Ax^n+By^n=cz^m$, where $m \in \{2,3,n\} $, $n\geqslant 7 $ is a prime. Moreover, we completely solve some particular cases ($A=5^{\alpha}, ~B=64,~ c=3, ~m=2;…

In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, we first give an explicit formula for all positive integer solutions of the Diophantine equation…