We show that if $k$ is a positive integer, then there are, under certain technical hypotheses, only finitely many coprime positive $k$-term arithmetic progressions whose product is a perfect power. If $4 \leq k \leq 11$, we obtain the more precise conclusion that there are, in fact, no such progressions. Our proofs exploit the modularity of Galois representations corresponding to certain Frey curves, together with a variety of results, classical and modern, on solvability of ternary Diophantine equations. As a straightforward corollary of our work, we sharpen and generalize a theorem of Sander on rational points on superelliptic curves.
Abstract. We show that the product of four or five consecutive positive terms in arithmetic progression can never be a perfect power whenever the initial term is coprime to the common difference of the arithmetic progression. This is a generalization of the results of Euler and Obláth for the case of squares, and an extension of a theorem of Győry on three terms in arithmetic progressions. Several other results concerning the integral solutions of the equation of the title are also obtained. We extend results of Sander on the rational solutions of the equation in n, y when b = d = 1. We show that there are only finitely many solutions in n, d, b, y when k ≥ 3, l ≥ 2 are fixed and k + l > 6.
We prove that for any positive integers x, d and k with gcd(x, d) = 1 and 3 < k < 35, the product x(x + d) · · · (x + (k − 1)d) cannot be a perfect power. This yields a considerable extension of previous results of Győry et al. and Bennett et al., which covered the cases where k ≤ 11. We also establish more general theorems for the case where x can also be a negative integer and where the product yields an almost perfect power. As in the proofs of the earlier theorems, for fixed k we reduce the problem to systems of ternary equations. However, our results do not follow as a mere computational sharpening of the approach utilized previously; instead, they require the introduction of fundamentally new ideas. For k > 11, a large number of new ternary equations arise, which we solve by combining the Frey curve and Galois representation approach with local and cyclotomic considerations. Furthermore, the number of systems of equations grows so rapidly with k that, in contrast with the previous proofs, it is practically impossible to handle the various cases in the usual manner. The main novelty of this paper lies in the development of an algorithm for our proofs, which enables us to use a computer. We apply an efficient, iterated combination of our procedure for solving the new ternary equations that arise with several sieves based on the ternary equations already solved. In this way, we are able to exclude the solvability of the enormous number of systems of equations under consideration. Our general algorithm seems to work for larger values of k as well, although there is, of course, a computational time constraint.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.