Perfect powers in sum of three fifth powers (Q2116767)

The authors determine the perfect powers that are sums of three fifth powers in an arithmetic progression. To be more precise, they completely solve the Diophantine equation \[ (x-d)^5 + x^5 + (x+d)^5 = z^n, \quad n\geq 2, \] where \(d, x, z \in \mathbb Z\) and \(d = 2^a 5^b\) with \(a, b \geq 0\) (Theorem 1). Proof of Theorem 1 for \(n \geq 7\) uses the modular method: one applies the recipes of \textit{M. A. Bennett} and \textit{C. M. Skinner} [Can. J. Math. 56, No. 1, 23--54 (2004; Zbl 1053.11025)] to appropriate family of Fermat type equations of signature \((n,n,2)\) (see sections 2, 4 and 5). Necessary data for newform computations were done using Magma. The cases \(n = 2, 3, 5\) use a variety of elementary and advanced methods (calculation of \(S\)-integral points on certain elliptic curves and the results of \textit{M. A. Bennett} and \textit{A. Koutsianas} [Acta Arith. 198, No. 4, 387--399 (2021; Zbl 1475.11049)]). The introduction contains a nice overview of results and conjectures related to some variants and generalizations.