On integers which are not differences of two powers (Q4817680)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2100962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On integers which are not differences of two powers |
scientific article; zbMATH DE number 2100962 |
Statements
On integers which are not differences of two powers (English)
0 references
15 September 2004
0 references
exponential Diophantine equations
0 references
0.8380882143974304
0 references
0.8375148177146912
0 references
0.7744377851486206
0 references
0.7738688588142395
0 references
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.
0 references