Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-25T05:33:33.449Z Has data issue: false hasContentIssue false
  • English
  • Français

Perfect powers from products of consecutive terms in arithmetic progression

Part of: Diophantine equations Sequences and sets

Published online by Cambridge University Press:  01 July 2009

K. Győry ,
L. Hajdu  and
Á. Pintér
K. Győry
Affiliation:
Institute of Mathematics, University of Debrecen, and the Number Theory Research Group of the Hungarian Academy of Sciences, PO Box 12, H-4010 Debrecen, Hungary (email: [email protected])
L. Hajdu
Affiliation:
Institute of Mathematics, University of Debrecen, and the Number Theory Research Group of the Hungarian Academy of Sciences, PO Box 12, H-4010 Debrecen, Hungary (email: [email protected])
Á. Pintér
Affiliation:
Institute of Mathematics, University of Debrecen, and the Number Theory Research Group of the Hungarian Academy of Sciences, PO Box 12, H-4010 Debrecen, Hungary (email: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

perfect powersarithmetic progressionternary diophantine equationsmodular forms

MSC classification

Secondary: 11D61: Exponential equations 11B25: Arithmetic progressions
Type
Research Article
Information
Compositio Mathematica , Volume 145 , Issue 4 , July 2009 , pp. 845 - 864
Copyright
Copyright © Foundation Compositio Mathematica 2009

References

[1]Bennett, M. A., Recipes for ternary Diophantine equations of signature (p,p,k), Proc. RIMS Kokyuroku (Kyoto) 1319 (2003), 51–55.Google Scholar
[2]Bennett, M. A., Powers from five terms in arithmetic progression, in Diophantine equations (Narosa Publishing House, New Delhi, 2008), 53–57.Google Scholar
[3]Bennett, M. A., Bruin, N., Győry, K. and Hajdu, L., Powers from products of consecutive terms in arithmetic progression, Proc. London Math. Soc. 92 (2006), 273–306.CrossRefGoogle Scholar
[4]Bennett, M. A., Győry, K. and Pintér, Á., On the diophantine equation 1k+2k+⋯+x k=y n, Compositio Math. 140 (2004), 1417–1431.CrossRefGoogle Scholar
[5]Bennett, M. A. and Skinner, C., Ternary diophantine equations via Galois representations and modular forms, Canad. J. Math. 56 (2004), 23–54.CrossRefGoogle Scholar
[6]Bennett, M. A., Vatsal, V. and Yazdani, S., Ternary Diophantine equations of signature (p,p,3), Compositio Math. 140 (2004), 1399–1416.CrossRefGoogle Scholar
[7]Bosma, W., Cannon, J. and Playoust, C., The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), 235–265.CrossRefGoogle Scholar
[8]Cohen, H., Number theory. Vol. II: Analytic and modern tools, Graduate Texts in Mathematics, vol. 240 (Springer, New York, 2007).Google Scholar
[9]Darmon, H. and Merel, L., Winding quotients and some variants of Fermat’s last theorem, J. Reine Angew. Math. 490 (1997), 81–100.Google Scholar
[10]Dénes, P., Über die diophantische Gleichung x l+y l=cz l, Acta Math. 88 (1952), 241–251.CrossRefGoogle Scholar
[11]Dickson, L. E., History of the theory of numbers. Vol. II: Diophantine analysis (Chelsea Publishing Co., New York, 1966).Google Scholar
[12]Erdős, P. and Selfridge, J. L., The product of consecutive integers is never a power, Illinios J. Math. 19 (1975), 292–301.Google Scholar
[13]Győry, K., On the diophantine equation n(n+1)⋯(n+k−1)=bx l, Acta Arith. 83 (1998), 87–92.CrossRefGoogle Scholar
[14]Győry, K., Power values of products of consecutive integers and binomial coefficients, in Number theory and its applications (Kluwer, Dordrecht, 1999), 145–156.Google Scholar
[15]Győry, K., Hajdu, L. and Saradha, N., On the diophantine equation n(n+d)⋯(n+(k−1)d)=by l, Canad. Math. Bull. 47 (2004), 373–388; correction: Canad. Math. Bull. 48 (2005), 636.CrossRefGoogle Scholar
[16]Hajdu, L., Tengely, Sz. and Tijdeman, R., Cubes in products of terms in arithmetic progression, Publ. Math. Debrecen 74 (2009), 215–232.CrossRefGoogle Scholar
[17]Hirata-Kohno, N., Laishram, S., Shorey, T. and Tijdeman, R., An extension of a theorem of Euler, Acta Arith. 129 (2007), 71–102.CrossRefGoogle Scholar
[18]Kraus, A., Majorations effectives pour l’équation de Fermat généralisée, Canad. J. Math. 49 (1997), 1139–1161.CrossRefGoogle Scholar
[19]Obláth, R., Über das Produkt fünf aufeinander folgender Zahlen in einer arithmetischen Reiche, Publ. Math. Debrecen 1 (1950), 222–226.CrossRefGoogle Scholar
[20]Obláth, R., Eine Bemerkung über Produkte aufeinander folgender Zahlen, J. Indian Math. Soc. 15 (1951), 135–139.Google Scholar
[21]Ribet, K., On the equation a p+2αb p+c p=0, Acta Arith. 79 (1997), 7–16.CrossRefGoogle Scholar
[22]Sander, J. W., Rational points on a class of superelliptic curves, J. London Math. Soc. 59 (1999), 422–434.CrossRefGoogle Scholar
[23]Saradha, N., On perfect powers in products with terms from arithmetic progressions, Acta Arith. 82 (1997), 147–172.CrossRefGoogle Scholar
[24]Saradha, N. and Shorey, T. N., Almost perfect powers in arithmetic progression, Acta Arith. 99 (2001), 363–388.CrossRefGoogle Scholar
[25]Shorey, T. N., Powers in arithmetic progression, in A panorama in number theory ed. G. Wüstholz (Cambridge University Press, Cambridge, 2002), 325–336.Google Scholar
[26]Shorey, T. N., Powers in arithmetic progression (II), in New aspects of analytic number theory (Research Institute for Mathematical Sciences, Kyoto University, Kyoto, 2002), 202–214.Google Scholar
[27]Tengely, Sz., Note on the paper ‘An extension of a theorem of Euler’ by Hirata-Kohno et al., Acta Arith. 134 (2008), 329–335.CrossRefGoogle Scholar
[28]Tijdeman, R., Diophantine equations and diophantine approximations, in Number theory and applications (Kluwer, Dordrecht, 1989), 215–243.Google Scholar
[29]Wiles, A., Modular elliptic curves and Fermat’s last theorem, Ann. of Math. (2) 141 (1995), 443–551.CrossRefGoogle Scholar