Almost perfect powers in consecutive integers. II (Q735435)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost perfect powers in consecutive integers. II |
scientific article; zbMATH DE number 5619300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost perfect powers in consecutive integers. II |
scientific article; zbMATH DE number 5619300 |
Statements
Almost perfect powers in consecutive integers. II (English)
0 references
22 October 2009
0 references
Let \(k\) be an integer. The authors find all integers of the form \(by^\ell\), where \(\ell\geq2\), and the greatest prime factor of \(b\) is at most \(k\) such that they are all products of \(k\) consecutive integers with two terms omitted. Namely, if these integers are \(n+d_1\), \(n+d_2\), \dots, \(n+d_{k-2}\), \(0\leq d_1<d_2<d_{k-2}<k\), then the only solutions are obtained for \(\ell=3\), \(k=4\), \(n=125\) or \(k=7\) and the greatest prime factor of \(b\) is \(7\). This result can be compared to a previous result of the same authors (with \textit{G. Hanrot}) [Acta Arith. 99, No. 1, 13--25 (2001; Zbl 0971.11017)] where exactly one term was omitted. The proof involves the solution of difficult exponential and Thue equations.
0 references
arithmetic progressions
0 references
exponential Diophantine equations
0 references
generalized Fermat equations
0 references
modular methods
0 references
Thue equations
0 references
0 references