# On perfect powers that are sums of cubes of a five term arithmetic progression

@article{ArgaezGarcia2019OnPP,
title={On perfect powers that are sums of cubes of a five term arithmetic progression},
author={Alejandro Arg'aez-Garc'ia},
journal={Journal of Number Theory},
year={2019}
}
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 cubes. Recently, the equation $(x-r)^k + x^k + (x+r)^k$ has been studied for $k=4$ by Zhongfeng Zhang and for $k=2$ by Koutsianas. In this paper, we complement the work of Cassels, Koutsianas and Zhang by considering the case when $k=3$ and showing that the…
Perfect powers in sum of three fifth powers
• Mathematics
• 2020
In this paper we determine the perfect powers that are sums of three fifth powers in an arithmetic progression. More precisely, we completely solve the Diophantine equation  (x-d)^5 + x^5 + (x +
On the sum of fourth powers of numbers in arithmetic progression
We prove that the equation ${ (x - y)^4 + x^4 + (x + y)^4 = z^n }$ has no integer solutions ${ x, y, z}$ with ${ \gcd(x, y) = 1 }$ for all integers ${ n > 1 }$. We mainly use a modular approach with
Perfect powers that are sums of squares of an arithmetic progression
• Mathematics
• 2018
In this paper, we determine all primitive solutions to the equation $(x+r)^2 +(x+2r)^2 +\cdots +(x+dr)^2 = y^n$ for $2\leq d\leq 10$ and for $1\leq r\leq 10^4$. We make use of a factorization
On perfect powers that are sums of cubes of a seven term arithmetic progression
• Mathematics
• 2019
Abstract We prove that the equation ( x − 3 r ) 3 + ( x − 2 r ) 3 + ( x − r ) 3 + x 3 + ( x + r ) 3 + ( x + 2 r ) 3 + ( x + 3 r ) 3 = y p only has solutions which satisfy x y = 0 for 1 ≤ r ≤ 10 6 and
On the solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ for $d$ a prime power
In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the
The Diophantine equation $(x+1)^k+(x+2)^k+\cdots+(\ell x)^k=y^n$ revisited
• Mathematics
• 2020
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
The equation $(x-d)^5+x^5+(x+d)^5=y^n$
• Mathematics
• 2020
In this paper, we solve the equation of the title under the assumption that $\gcd(x,d)=1$ and $n\geq 2$. This generalizes earlier work of the first author, Patel and Siksek [BPS16]. Our main tools
Perfect powers that are sums of squares in a three term arithmetic progression
• Mathematics
International Journal of Number Theory
• 2018
We determine primitive solutions to the equation [Formula: see text] for [Formula: see text], making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
On the power values of the sum of three squares in arithmetic progression
• Mathematics
• 2021
In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, firstly, we give an explicit formula for all positive integer
On the sum of fourth powers in arithmetic progression
We prove that the equation ${ (x - y)^4 + x^4 + (x + y)^4 = z^n }$ has no integer solutions ${ x, y, z}$ with ${ \gcd(x, y) = 1 }$ for all integers ${ n > 1 }$. We mainly use a modular approach with