On integers which are not differences of two powers
ErdΕs asked if there are infinitely many integers \(k\) which are not a difference or a sum of two powers. This is certainly a difficult question. A partial result concerning this question is obtained in this paper: Theorem. Let \(K\) be any positive constant \({}>2\). Then there exist two integers \(A\) and \(B\) (de\-pend\-ing on \(K\)) such that, for \(x>x_0(K)\), and for a positive proportion of prime numbers \(p\leq x\), the integer \(Ap^B\) is not of the form \(| u^m\pm v^n| \) for \(u\), \(v\), \(m\), \(n\in \mathbb{Z}\) with \(2\leq \min\{m,n\}\leq K\). The proof is quite involved. It uses many deep tools: a theorem of Darmon-Granville on the equation \(Ax^p+By^q=Cz^r\), a theorem of Bugeaud on the greatest prime divisor of \(ax^m+by^n\), lower bounds of linear forms of logarithms of algebraic numbers, \dots\ and a study of many subcases.
- scientific article; zbMATH DE number 4053712 (Why is no real title available?)
- Fibonacci numbers that are not sums of two prime powers
- On integers which are the sum of a power of 2 and a polynomial value
- On integers not of the form Β±π^{π}Β±π^{π}
- scientific article; zbMATH DE number 5030420 (Why is no real title available?)
This page was built for publication: On integers which are not differences of two powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4817680)