Arithmetic progressions consisting of unlike powers (Q2385789): Difference between revisions

The following theorem is proved (Theorem 1 of the paper): Let \(k\geq 4\) and \(L\geq 2\). Then, there are only finitely many \(k\)-term integral arithmetic progressions \((h_0,h_1,\ldots,h_{k-1})\) such that \(h_0,h_1\) are relatively prime and for each \(i=0,1,\ldots, k-1\), \(h_i=x_i^{l_i}\) with \(x_i,l_i\) integers and \(2\leq l_i\leq L\). Actually, this is a consequence of the following more general theorem (Theorem 2 of the paper): Let \(L,k,D\) be positive integers with \(L\geq 2\), \(k\geq 3\) and let \(S\) be a finite set of primes. Then, there are at most finitely many arithmetic progressions \((h_0,h_1,\ldots,h_{k-1})\) satisfying the following conditions: {\parindent=8mm \begin{itemize}\item[(i)] For \(i=0,1,\ldots,k-1\) there exist integers \(x_i,l_i\) with \(2\leq l_i\leq L\) and non-zero \(S\)-integer \(\eta_i\) such that \(h_i=\eta_ix_i^{l_i}\). \item[(ii)] \(\gcd(h_0,h_1)\leq D\). \item[(iii)] Either \(k\geq 5\); or \(k=4\) and \(l_i\geq 3\) for some \(i\); or \(k=3\) and \({1\over l_0}+{1\over l_1}+{1\over l_2}<1\). \end{itemize}} This theorem is, in turn, based on a result of \textit{H. Darmon} and \textit{A. Granville} concerning equations \(Ax^p+By^q=Cz^r\) [Bull. Lond. Math. Soc. 27, 513--543 (1995; Zbl 0838.11023)]. Note that, as it is shown in the paper, the condition that \(h_0,h_1\) be relatively prime is quite essential. The third main result of the paper is explicit: In the first theorem above, if \(L=3\), then, necessarily, \((h_0,h_1,\dots,h_{k-1})=\pm 1\). For the proof of the last result, the authors reduce the problem to a finite number of hyperelliptic equations which they solve by either the ``Chabauty's method'' or by the ``Elliptic Chabauty method''.