Related papers: On the Diophantine equation $(x+1)^{k}+(x+2)^{k}+.…

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

In this paper, we investigate the Diophantine equation \[ (2^k - 1)(3^k - 1) = x^n \] and prove that it has no solutions in positive integers $k, x, n > 2$.

In this paper, we consider the exponential Diophantine equation \( (2^k-1)(b^k-1)=y^q \) with $k\ge 2$, odd integer $b$ and an odd prime exponent $q$ and obtain effective upper bounds for $q$ in terms of $b$. In particular, we show that…

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 $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we…

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

Let L_t denote the t-th Lucas number. We prove that the Diophantine equation L_m^{n+k} + L_m^n = L_r has no solutions in positive integers r, m, n, and k with m >= 2. In the case n = 1, the proof is based on a precise factorization formula…

We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y+1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.

The title equation, where $p>3$ is a prime number $\not\equiv 7 \pmod 8$, $q$ is an odd prime number and $x,y,n$ are positive integers with $x,y$ relatively prime, is studied. When $p\equiv 3\pmod 8$, we prove (Theorem 2.3) that there are…

Let $k,l\geq2$ be fixed integers. In this paper, firstly, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(lx)^{k}=y^{n}$ in integers $x,y,n$ with $x,y\geq1, n\geq2$ satisfy $n<C_{1}$ where $C_{1}=C_{1}(l,k)$ is an…

Suppose that $n$ is a positive integer. In this paper, we show that the exponential Diophantine equation $$(n-1)^{x}+(n+2)^{y}=n^{z},\ n\geq 2,\ xyz\neq 0$$ has only the positive integer solutions $(n,x,y,z)=(3,2,1,2), (3,1,2,3)$. The main…

In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in…

We find all solutions of Diophantine equation x^{2}+11^{2k} = y^{n} where x>=1, y>=1, n>=3 and k is natural number. We give p-adic interpretation of this equation.

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…

We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1},\ldots, a_{k}$ satisfying the conditions $k\geq 2$ and $a_{i}<a_{i+1}$ for…

The main aim of this article is to find all solutions of the Diophantine equation $x^2 + p^k=y^n$ where $p \equiv 1 \pmod 4$, $\frac{p-1}{3}$ is a perfect square and the class number of $\mathbb{Z}[\sqrt{-p}]$ is $2$. In this article, I…

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…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

We give the complete solution in integers $(n,a,b,x,y)$ of the title equation when $\gcd(x,y)=1$, except for the case when $xab$ is odd.