Consecutive powers
From MaRDI portal
The author gives a very readable history of Catalan's problem. He begins with Levy ben Gerson's solution of Philippe de Vitry's question: Can \(3^ m\pm 1\) be a power of 2 ? The article ends with the announcement of an unpublished result of R. Tijdeman: For a natural number N let S be the set of numbers, all of whose prime factors are less than N. Then there exists a computable constant C, depending only on N, such that if m,n,x,\(y\geq 2\), \(\gcd(ax,k)=1,\quad | a|,\quad | b|,\quad | k| \in S,\) and \(ax^ m-by^ n=k\) then \(\max \{| a|,| b|,| k|,m,n,x,y\}\leq C.\)
Recommendations
- Consecutive powers in continued fractions
- POWERS FROM PRODUCTS OF CONSECUTIVE TERMS IN ARITHMETIC PROGRESSION
- Powers in arithmetic progressions
- On powers that are sums of consecutive like powers
- Almost perfect powers in consecutive integers
- On the sum of powers of consecutive integers
- Power values of sums of products of consecutive integers
- Arithmetic progressions consisting of unlike powers
- scientific article; zbMATH DE number 5529021
- Powers of sequences and recurrence
Cited in
(4)
This page was built for publication: Consecutive powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792367)
