相关论文: Perfect powers in products of terms of elliptic di…

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…

We prove that there are finitely many perfect powers in elliptic divisibility sequences generated by a non-integral point on elliptic curves of the from $y^2=x(x^2+b)$, where $b$ is any positive integer. We achieve this by using the…

It is shown that there are finitely many perfect powers in an elliptic divisibility sequence whose first term is divisible by 2 or 3. For Mordell curves the same conclusion is shown to hold if the first term is greater than 1. Examples of…

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…

If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$…

Let $n$ be a non-negative integer and put $p_{n}(x)=\prod_{i=0}^{n}(x+i)$. In the first part of the paper, for given $n$, we study the existence of integer solutions of the Diophantine equation $$ y^m=p_{n}(x)+\sum_{i=1}^{k}p_{a_{i}}(x), $$…

Let $E$ be an elliptic curve over the rationals given by an integral Weierstrass model and let $P$ be a rational point of infinite order. The multiple $nP$ has the form $(A_n/B_n^2,C_n/B_n^3)$ where $A_n$, $B_n$, $C_n$ are integers with…

In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+…

By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $\binom{n}{k}=\binom{m}{l}+d$ for $-3\leq d\leq 3$ and $(k,l)\in\{(2,3),\; (2,4),\;(2,5),\; (2,6),\; (2,8),\; (3,4),\;…

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 find all solutions of the exponential Diophantine equation $B_{n+1}^x-B_n^x=B_m$ in positive integer variables $(m, n, x)$, where $B_k$ is the $k$-th term of the Balancing sequence.

Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…

In literature, there are two different definitions of elliptic divisibility sequences. The first one says that a sequence of integers $\{h_n\}_{n\geq 0}$ is an elliptic divisibility sequence if it verifies the recurrence relation…

In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…

We completely solve the Diophantine equation $x^2+2^k11^\ell19^m=y^n$ in integers $x,y\geq 1;~ k,\ell, m\geq 0~$ and $n\geq 3$ with $\gcd(x,y)=1$, except the case $2\mid k, 2\nmid \ell m$ and $5\mid n$. We use this result to recover some…

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine…

Let $(P_n)_{n\ge 0}$ and $(Q_n )_{n\ge 0}$ be the Pell and Pell-Lucas sequences. Let $b$ be a positive integer such that $b\ge 2.$ In this paper, we prove that the following two Diophantine equations $P_{n}=b^{d}P_{m}+Q_{k}$ and…

The subject matter of this work is the diophantine equation x^n+y^m=c(x^k)(y^l), where n,m,k,l,c are natural numbers.We investigate this equation from the point of view of positive integer solutions.A preliminary examination of sources such…

Let $k,\ell\geq2$ be fixed integers and $C$ be an effectively computable constant depending only on $k$ and $\ell$. In this paper, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(\ell x)^{k}=y^{n}$ in integers $x,y,n$…

We show that the diophantine equation $n^\ell+(n+1)^\ell + ...+ (n+k)^\ell=(n+k+1)^\ell+ ...+ (n+2k)^\ell$ has no solutions in positive integers $k,n \ge 1$ for all $\ell \ge 3$.