The purpose of this paper is to prove that the common terms of linear recurrences $M(2a,-1,0,b)$ and $N(2c,-1,0,d)$ have at most $2$ common terms if $p=2$, and have at most three common terms if $p>2$ where $D$ and $p$ are fixed positive integers and $p$ is a prime, such that neither $D$ nor $D+p$ is perfect square, further $a,b,c,d$ are nonzero integers satisfying the equations $a^2-D{b}^2=1$ and $c^2-(D+p)d^2=1$.

Let $\mathbb{Z}$, $\mathbb{N}$ be the sets of all integers and positive integers, respectively. Let $p$ be a fixed odd prime. Recently, there have been many papers concerned with solutions $(x,y,n,a,b)$ of the equation $x^2+2^a{p}^b=y^n$, $x,y,n\in \mathbb{N}$, $gcd(x,y)=1$, $n\ge 3$, $a,b\in \mathbb{Z}$, $a\ge 0$, $b\ge 0.$ And all solutions of it have been determined for the cases $p=3$, $p=5$, $p=11$ and $p=13$. In this paper, we mainly concentrate on the case $p=3$, and using certain recent results on exponential diophantine equations including the famous Catalan equation, all solutions $(x,y,n,a,b)$ of the equation $x^2+2^a·{17}^b=y^n$, $x,y,n\in \mathbb{N}$, $gcd(x,y)=1$, $n\ge 3$, $a,b\in \mathbb{Z}$, $a\ge 0$,...

Let $a$, $b$, $c$, $r$ be positive integers such that $a^2+b^2=c^r$, $min(a,b,c,r)>1$, $gcd(a,b)=1,a$ is even and $r$ is odd. In this paper we prove that if $b\equiv 3\left(mod4\right)$ and either $b$ or $c$ is an odd prime power, then the equation $x^2+b^y=c^z$ has only the positive integer solution $(x,y,z)=(a,2,r)$ with $min(y,z)>1$.

Let a,b and c be relatively prime positive integers such that a²+b² = c². We prove that if $b\equiv 0\left(mod{2}^r\right)$ and $b\equiv \pm 2^r\left(moda\right)$ for some non-negative integer r, then the Diophantine equation $a^x+b^y=c^z$ has only the positive solution (x,y,z) = (2,2,2). We also show that the same holds if c ≡ -1 (mod a).

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.