In this paper, we find all the solutions of the Diophantine equation $B_1^p+2B_2^p+\cdots +k{B}_k^p=B_n^q$ in positive integer variables $(k,n)$, where $B_i$ is the $i^{th}$ balancing number if the exponents $p$, $q$ are included in the set $\{1,2\}$.

Let g ≥ 2 be an integer and ${}_g\subset \mathbb{N}$ be the set of repdigits in base g. Let ${}_g$ be the set of Diophantine triples with values in ${}_g$; that is, ${}_g$ is the set of all triples (a,b,c) ∈ ℕ³ with c < b < a such that ab + 1, ac + 1 and bc + 1 lie in the set ${}_g$. We prove effective finiteness results for the set ${}_g$.

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.

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.

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$.

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.

The triples $(x,y,z)=(1,z^z-1,z)$, $(x,y,z)=(z^z-1,1,z)$, where $z\in \mathbb{N}$, satisfy the equation $x^y+y^x=z^z$. In this paper it is shown that the same equation has no integer solution with $min\{x,y,z\}>1$, thus a conjecture put forward by Z. Zhang, J. Luo, P. Z. Yuan (2013) is confirmed.

We consider systems of equations of the form $x_i+x_j=x_k$ and $x_i·x_j=x_k$, which have finitely many integer solutions, proposed by A. Tyszka. For such a system we construct a slightly larger one with much more solutions than the given one.

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$.

Consider the system $x^2-a{y}^2=b$, $P(x,y)=z^2$, where $P$ is a given integer polynomial. Historically, the integer solutions of such systems have been investigated by many authors using the congruence arguments and the quadratic reciprocity. In this paper, we use Kedlaya’s procedure and the techniques of using congruence arguments with the quadratic reciprocity to investigate the solutions of the Diophantine equation $7X^2+Y^7=Z^2$ if $(X,Y)=(L_n,F_n)$ (or $(X,Y)=(F_n,L_n)$) where $\left\{F_n\right\}$ and $\left\{L_n\right\}$ represent the sequences of Fibonacci numbers and Lucas numbers...

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 $[·]$ be the floor function. In this paper, we prove by asymptotic formula that when $1<c<\frac{3441}{2539}$, then every sufficiently large positive integer $N$ can be represented in the form $$N=\left[p_1^c\right]+\left[p_2^c\right]+\left[p_3^c\right]+\left[p_4^c\right]+\left[p_5^c\right],$$ where $p_1$, $p_2$, $p_3$, $p_4$, $p_5$ are primes such that $p_1=x^2+y^2+1$.

In p. 219 of R.K. Guy’s , 3rd edn., Springer, New York, 2004, we are asked to prove that the Diophantine equation $x^n+y^n=n!z^n$ has no integer solutions with $n\in {\mathbb{N}}_{+}$ and $n>2$. But, contrary to this expectation, we show that for $n=3$, this equation has infinitely many primitive integer solutions, i.e. the solutions satisfying the condition $gcd(x,y,z)=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\&gt;1$, $b\&gt;1$, $c\&gt;0$, $r\&gt;0$ and $s\&gt;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)\&lt;2·{10}^{15}$ for each solution; when $gcd(a,b)\&gt;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.