Related papers: On the Diophantine equation $cx^2+p^{2m}=4y^n$

We consider the Diophantine equation $7x^{2} + y^{2n} = 4z^{3}$. We determine all solutions to this equation for $n = 2, 3, 4$ and $5$. We formulate a Kraus type criterion for showing that the Diophantine equation $7x^{2} + y^{2p} = 4z^{3}$…

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…

In this article the Diophantine equations of the form $x^{2}-8C_{n}xy+ 16y^{2}=\pm2^{r}$, $x^{4}-8C_{n}x^{2}y+ 16y^{2}=\pm2^{r}$ and $x^{2}-8C_{n}xy^{2}+ 16y^{4}=\pm2^{r}$ are taken into consideration for the investigations of existence of…

We prove that for each odd prime p, positive integer alpha, and non-negative integers beta and gamma, the Diophantine equation X^{2N} + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z^5 has no solution with X, Z, N in Z^+, N > 1, and gcd(X,Z) = 1.

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…

Let k>=2 and let (Q_{n}^{(k)})_{n>=2-k} be the k-generalized Pell sequence defined by Q_{n}^{(k)}=2Q_{n-1}^{(k)}+Q_{n-2}^{(k)}+...+Q_{n-k}^{(k)} for n>=2 with initial conditions Q_{-(k-2)}^{(k)}=Q_{-(k-3)}^{(k)}=...=Q_{-1}^{(k)}=0,…

In this paper, we prove a theorem about the integer solutions to the Diophantine equation $x^{4}-q^{4}=py^{r}$, extending previous work of K.Gy\H ory, and F.Luca and A.Togbe, and of the author.

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…

Let $1<c<\frac{26088036}{12301745},c\not=2$ and $N$ be a sufficiently large real number. In this paper, it is proved that, for almost all $R\in (N,2N]$, the Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c-R\big|<\log^{-1}N…

Let $p$ be a prime number with $p>3$, $p\equiv 3\pmod{4}$ and let $n$ be a positive integer. In this paper, we prove that the Diophantine equation $(5pn^{2}-1)^{x}+(p(p-5)n^{2}+1)^{y}=(pn)^{z}$ has only the positive integer solution…

In this article, we study the non-trivial primitive solutions of a certain type for the Diophantine equations $x^p+y^p=2^rz^p$ and $x^p+y^p=z^2$ of prime exponent $p$, $r \in \mathbb{N}$, over a totally real field $K$. Then for $r=2,3$, we…

The quadruple $(1\,484\,801, 1\,203\,120, 1\,169\,407, 1\,157\,520)$ already known is essentially the only non-trivial solution of the Diophantine equation $x^4 + 2 y^4 = z^4 + 4 w^4$ for $|x|$, $|y|$, $|z|$, and $|w|$ up to one hundred…

The sufficient conditions for insolvability of the Diophantine equation $\sum_{i=1}^{m}x_i^{n}=bc^{n}$ ($n, m \geq 2$, $b, c\in \mathbb{N}$) in nonnegative integers are obtained for the case where the canonical decomposition of the number…

In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where…

In this paper we extend a result of Hirata-Kohno, Laishram, Shorey and Tijdeman on the Diophantine equation $n(n+d)...(n+(k-1)d)=by^2,$ where $n,d,k\geq 2$ and $y$ are positive integers such that $\gcd(n,d)=1.$

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…

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…

We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…

Let $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w…

We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by…