In this paper, we find all integer solutions $(x,y,n,a,b,c)$ of the equation in the title for non-negative integers $a,b$ and $c$ under the condition that the integers $x$ and $y$ are relatively prime and $n\ge 3$. The proof depends on the famous primitive divisor theorem due to Bilu, Hanrot and Voutier and the computational techniques on some elliptic curves.

Let ${\left(G_n\right)}_{n\ge 1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\left\{U_n\right\}$ and $\left\{V_n\right\}$, respectively. We show that the Diophantine equation $G_n=B·(g^{lm}-1)/(g^l-1)$ has only finitely many solutions in $n,m\in {\mathbb{Z}}^{+}$, where $g\ge 2$, $l$ is even and $1\le B\le g^l-1$. Furthermore, these solutions can be effectively determined by reducing such equation to biquadratic elliptic curves. Then, by a result of Baker (and its best improvement due to Hajdu and Herendi) related to the bounds of the integral...

Let $p$ be a fixed odd prime. We combine some properties of quadratic and quartic Diophantine equations with elementary number theory methods to determine all integral points on the elliptic curve $E:y^2=x^3-4p^{2}x$. Further, let $N\left(p\right)$ denote the number of pairs of integral points $(x,\pm y)$ on $E$ with $y>0$. We prove that if $p\ge 17$, then $N\left(p\right)\le 4$ or $1$ depending on whether $p\equiv 1(mod8)$ or $p\equiv -1(mod8)$.

Let $D_m$ be an elliptic curve over $\mathbb{Q}$ of the form $y^2=x^3-m^{2}x+m^2$, where $m$ is an integer. In this paper we prove that the two points $P_{-1}=(-m,m)$ and $P_0=(0,m)$ on $D_m$ can be extended to a basis for $D_m\left(\mathbb{Q}\right)$ under certain conditions described explicitly.

S. S. Pillai proved that for a fixed positive integer $a$, the exponential Diophantine equation $x^y-y^x=a$, $min(x,y)>1$, has only finitely many solutions in integers $x$ and $y$. We prove that when $a$ is of the form $2z^2$, the above equation has no solution in integers $x$ and $y$ with $gcd(x,y)=1$.

We consider $N$, the number of solutions $(x,y,u,v)$ to the equation ${(-1)}^{u}r{a}^x+{(-1)}^{v}s{b}^y=c$ in nonnegative integers $x,y$ and integers $u,v\in \{0,1\}$, for given integers $a\>1$, $b\>1$, $c\>0$, $r\>0$ and $s\>0$. When $gcd(ra,sb)=1$, we show that $N\le 3$ except for a finite number of cases all of which satisfy $max(a,b,r,s,x,y)\<2·{10}^{15}$ for each solution; when $gcd(a,b)\>1$, we show that $N\le 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving $N=3$ solutions.

We consider a variety of Euler’s sum of powers conjecture, i.e., whether the Diophantine system $$\left\{\begin{array}{c}n=a_1+a_2+\cdots +a_{s-1},\hfill \\ a_1{a}_2\cdots a_{s-1}(a_1+a_2+\cdots +a_{s-1})=b^s\hfill \end{array}\right.$$ has positive integer or rational solutions $n$, $b$, $a_i$, $i=1,2,\cdots ,s-1$, $s\ge 3.$ Using the theory of elliptic curves, we prove that it has no positive integer solution for $s=3$, but there are infinitely many positive integers $n$ such that it has a positive integer solution for $s\ge 4$. As a corollary, for $s\ge 4$ and any positive integer $n$, the above Diophantine system has a positive rational solution. Meanwhile, we give conditions...

Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots +k{F}_k^p=F_n^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers. A complete solution is given if the exponents are included in the set $\{1,2\}$. Based on the specific cases we could solve, and a computer search with $p,q,k\le 100$ we conjecture that beside the trivial solutions only $F_8=F_1+2F_2+3F_3+4F_4$, $F_4^2=F_1+2F_2+3F_3$, and $F_4^3=F_1^3+2F_2^3+3F_3^3$ satisfy the title equation.

Let ${\left(L_n\right)}_{n\ge 0}$ be the Lucas sequence. We show that the Diophantine equation $L_n-L_m=M_k$ has only the nonnegative integer solutions $(n,m,k)=(2,0,1)$, $(3,1,2)$, $(3,2,1)$, $(4,3,2)$, $(5,3,3)$, $(6,2,4)$, $(6,5,3)$ where $M_k=2^k-1$ is the $k$th Mersenne number and $n>m$.

We prove several results regarding some invariants of elliptic curves on average over the family of all elliptic curves inside a box of sides A and B. As an example, let E be an elliptic curve defined over ℚ and p be a prime of good reduction for E. Let $e_E\left(p\right)$ be the exponent of the group of rational points of the reduction modulo p of E over the finite field ${}_p$. Let be the family of elliptic curves $E_{a,b}:y^2=x^3+ax+b$, where |a| ≤ A and |b| ≤ B. We prove that, for any c > 1 and k∈ ℕ, $1/\left|\right|{\sum }_{E\in }{\sum }_{p\le x}{e}_E^k\left(p\right)=C_{k}li\left(x^{k+1}\right)+O(\left(x^{k+1}\right)/{\left(logx\right)}^c$)$$as x → ∞, as long...

Let $p$ be an odd prime. By using the elementary methods we prove that: (1) if $2\nmid x$, $p\equiv \pm 3(mod8),$ the Diophantine equation $(2^x-1)(p^y-1)=2z^2$ has no positive integer solution except when $p=3$ or $p$ is of the form $p=2a_0^2+1$, where $a_0>1$ is an odd positive integer. (2) if $2\nmid x$, $2\mid y$, $y\ne 2,4,$ then the Diophantine equation $(2^x-1)(p^y-1)=2z^2$ has no positive integer solution.

Let r,m be positive integers with r > 1, m even, and A,B be integers satisfying $A+B\surd (-1)={(m+\surd (-1))}^r$. We prove that the Diophantine equation ${\left|A\right|}^x+{\left|B\right|}^y={(m²+1)}^z$ has no positive integer solutions in (x,y,z) other than (x,y,z) = (2,2,r), whenever $r>{10}^{74}$ or $m>{10}^{34}$. Our result is an explicit refinement of a theorem due to F. Luca.