相关论文: Perfect powers in sum of three fifth powers

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

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we have determined all the powers of 2 which are sums of five Fibonacci numbers with few exceptions that…

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…

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 study the equation $(x-4r)^3 + (x-3r)^3 + (x-2r)^3+(x-r)^3 + x^3 + (x+r)^3+(x+2r)^3 + (x+3r)^3 + (x+4r)^3 = y^p$, which is a natural continuation of previous works carried out by A. Arg\'{a}ez-Garc\'{i}a and the fourth author (perfect…

In this paper we obtain a parametric solution of the hitherto unsolved diophantine equation $(x_1^5+x_2^5)(x_3^5+x_4^5)=(y_1^5+y_2^5)(y_3^5+y_4^5)$. Further, we show, using elliptic curves, that there exist infinitely many parametric…

Using only elementary arguments, Cassels and Uchiyama (independently) determined all squares that are sums of three consecutive cubes. Zhongfeng Zhang extended this result and determined all perfect powers that are sums of three consecutive…

In this paper, we refine the method introduced by Izadi and Baghalaghdam to search integer solutions to the Diophantine equation $X_1^5+X_2^5+X_3^5=Y_1^3+Y_2^3+Y_3^3$. We show that the Diophantine equation has infinitely many positive…

In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…

We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…

We show how sums of some $5th$ powers can be written as sums of some cubics

We prove that the equation $(x-3r)^3+(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3+(x+3r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime. This article complements the work on the equations…

We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.

We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.

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 $(L_n)_{n\geq 0}$ be the Lucas sequence given by $L_0 = 2, L_1 = 1$ and $L_{n+2} = L_{n+1}+L_n$ for $n \geq 0$. In this paper, we are interested in finding all powers of three which are sums of two Lucas numbers, i.e., we study the…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

Research on power values of power sums has gained much attention of late, partially due to the explosion of refinements in multiple advanced tools in (computational) Number Theory in recent years. In this survey, we present the key tools…

Motivated by the recent result of Farhi we show that for each $n\equiv \pm 1\pmod{6}$ the title Diophantine equation has at least two solutions in integers. As a consequence, we get that each (even) perfect number is a sum of three cubes of…