A note on Romanov's constant (Q858081): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10474-006-0060-6 / rank | |||
Property / author | |||
Property / author: János Pintz / rank | |||
Property / reviewed by | |||
Property / reviewed by: D. R. Heath-Brown / rank | |||
Property / author | |||
Property / author: János Pintz / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: D. R. Heath-Brown / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10474-006-0060-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2005537236 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10474-006-0060-6 / rank | |||
Normal rank |
Latest revision as of 05:44, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on Romanov's constant |
scientific article |
Statements
A note on Romanov's constant (English)
0 references
8 January 2007
0 references
It was shown by \textit{N. P. Romanov} [Math. Ann. 109, 668--678 (1934; Zbl 0009.00801)] that a positive proportion of integers can be written as a prime plus a power of 2. Define \[ R_1:=\liminf_{N\to \infty} N^{-1}\#\{n\leq N:n=p+2^m\}. \] Then \textit{Y.-G. Chen} and \textit{X.-G. Sun} [J. Number Theory 106, 275--284 (2004; Zbl 1049.11106)] showed that \(R_1\geq 0.0868\). In the present paper this is improved to \[ R_1\geq 0.09368. \] (A very slightly weaker bound has been obtained independently and simultaneously by \textit{L. Habsieger} and \textit{X. F. Roblot} [Acta Arith. 122, 45--50 (2006; Zbl 1131.11064)]. The paper shows that there is little room for improvement in the current line of analysis, and goes on to discuss the connection with the Goldbach-Linnik problem, in which one represents an even integer as a sum of two primes and a fixed number of powers of 2. In particular, various hypotheses under which it suffices to use two powers of 2 are highlighted.
0 references
Romanov's constant
0 references
generalized twin prime problem
0 references
Goldbach-Linnik problem
0 references
Romanov's theorem, numerical constant
0 references
Goldbach-Linnik problem, sieve method
0 references
power of 2
0 references