Romanov's theorem

From HandWiki
Short description: Theorem on the set of numbers that are the sum of a prime and a positive integer power of the base
Romanov's theorem
TypeTheorem
FieldAdditive number theory
Conjectured byAlphonse de Polignac
Conjectured in1849
First proof byNikolai Pavlovich Romanov
First proof in1934

In mathematics, specifically additive number theory, Romanov's theorem is a mathematical theorem proved by Nikolai Pavlovich Romanov. It states that given a fixed base b, the set of numbers that are the sum of a prime and a positive integer power of b has a positive lower asymptotic density.

Statement

Romanov initially stated that he had proven the statements "In jedem Intervall (0, x) liegen mehr als ax Zahlen, welche als Summe von einer Primzahl und einer k-ten Potenz einer ganzen Zahl darstellbar sind, wo a eine gewisse positive, nur von k abhängige Konstante bedeutet" and "In jedem Intervall (0, x) liegen mehr als bx Zahlen, weiche als Summe von einer Primzahl und einer Potenz von a darstellbar sind. Hier ist a eine gegebene ganze Zahl und b eine positive Konstante, welche nur von a abhängt".[1] These statements translate to "In every interval [math]\displaystyle{ (0,x) }[/math] there are more than [math]\displaystyle{ \alpha x }[/math] numbers which can be represented as the sum of a prime number and a k-th power of an integer, where [math]\displaystyle{ \alpha }[/math] is a certain positive constant that is only dependent on k" and "In every interval [math]\displaystyle{ (0,x) }[/math] there are more than [math]\displaystyle{ \beta x }[/math] numbers which can be represented as the sum of a prime number and a power of a. Here a is a given integer and [math]\displaystyle{ \beta }[/math] is a positive constant that only depends on a" respectively. The second statement is generally accepted as the Romanov's theorem, for example in Nathanson's book.[2]

Precisely, let [math]\displaystyle{ d(x)=\frac{\left\vert \{n\le x:n=p+2^k,p\ \textrm{prime,}\ k\in\N\} \right\vert}{x} }[/math] and let [math]\displaystyle{ \underline{d}=\liminf_{x\to\infty}d(x) }[/math], [math]\displaystyle{ \overline{d}=\limsup_{x\to\infty}d(x) }[/math]. Then Romanov's theorem asserts that [math]\displaystyle{ \underline{d}\gt 0 }[/math].[3]

History

Alphonse de Polignac wrote in 1849 that every odd number larger than 3 can be written as the sum of an odd prime and a power of 2. (He soon noticed a counterexample, namely 959.)[4] This corresponds to the case of [math]\displaystyle{ a=2 }[/math] in the original statement. The counterexample of 959 was, in fact, also mentioned in Euler's letter to Christian Goldbach,[5] but they were working in the opposite direction, trying to find odd numbers that cannot be expressed in the form.

In 1934, Romanov proved the theorem. The positive constant [math]\displaystyle{ \beta }[/math] mentioned in the case [math]\displaystyle{ a=2 }[/math] was later known as Romanov's constant.[6] Various estimates on the constant, as well as [math]\displaystyle{ \overline{d} }[/math], has been made. The history of such refinements are listed below.[3] In particular, since [math]\displaystyle{ \overline{d} }[/math] is shown to be less than 0.5 this implies that the odd numbers that cannot be expressed this way has positive lower asymptotic density.

Refinements of [math]\displaystyle{ \overline{d} }[/math] and [math]\displaystyle{ \underline{d} }[/math]
Year Lower bound on [math]\displaystyle{ \underline{d} }[/math] Upper bound on [math]\displaystyle{ \overline{d} }[/math] Prover Notes
1950 [math]\displaystyle{ 0.5-5.06\times 10^{-80} }[/math][lower-alpha 1] Paul Erdős ;[7] First proof of infinitely many odd numbers that are not of the form [math]\displaystyle{ 2^k+p }[/math] through
an explicit arithmetic progression
2004 0.0868 Chen, Xun [8]
2006 0.0933 0.49094093[lower-alpha 2] Habsieger, Roblot ;[9] Considers only odd numbers; not exact, see note
2006 0.093626 Pintz ;[6] originally proved 0.9367, but an error was found and fixing it would yield 0.093626
2010 0.0936275 Habsieger, Sivak-Fischler [10]
2018 0.107648 Elsholtz, Schlage-Puchta
  1. ↑ Exact value is [math]\displaystyle{ 0.5-\frac{1}{2^{241}\times 3\times 5\times 7\times 13\times 17\times 241} }[/math].
  2. ↑ The value cited is 0.4909409303984105956480078184, which is just approximate.

Generalisations

Analogous results of Romanov's theorem has been proven in number fields by Riegel in 1961.[11] In 2015, the theorem was also proven for polynomials in finite fields.[12] Also in 2015, an arithmetic progression of Gaussian integers that are not expressible as the sum of a Gaussian prime and a power of 1+i is given.[13]

References

  1. ↑ Romanoff, N. P. (1934-12-01). "Über einige Sätze der additiven Zahlentheorie" (in de). Mathematische Annalen 109 (1): 668–678. doi:10.1007/BF01449161. ISSN 1432-1807. 
  2. ↑ Nathanson, Melvyn B. (2013-03-14) (in en). Additive Number Theory The Classical Bases. Springer Science & Business Media. ISBN 978-1-4757-3845-2. https://books.google.com/books?id=nbjVBwAAQBAJ&dq=%22Romanov's+Theorem%22&pg=PR7. 
  3. ↑ 3.0 3.1 Elsholtz, Christian; Schlage-Puchta, Jan-Christoph (2018-04-01). "On Romanov's constant" (in en). Mathematische Zeitschrift 288 (3): 713–724. doi:10.1007/s00209-017-1908-x. ISSN 1432-1823. 
  4. ↑ de Polignac, A. (1849). "Recherches nouvelles sur les nombres premiers" (in fr). Comptes rendus 29: 397–401. https://babel.hathitrust.org/cgi/pt?id=mdp.39015035450967&view=1up&seq=411. 
  5. ↑ L. Euler, Letter to Goldbach. 16-12-1752.
  6. ↑ 6.0 6.1 Pintz, János (2006-07-01). "A note on Romanov's constant" (in en). Acta Mathematica Hungarica 112 (1): 1–14. doi:10.1007/s10474-006-0060-6. ISSN 1588-2632. 
  7. ↑ Erdős, Paul (1950). "On Integers of the form [math]\displaystyle{ 2^k+p }[/math] and some related problems". Summa Brasiliensis Mathematicae 2: 113–125. http://pdfs.semanticscholar.org/8a60/262f058fd92e01f26251d6224b00d1e42a8c.pdf. 
  8. ↑ Chen, Yong-Gao; Sun, Xue-Gong (2004-06-01). "On Romanoff's constant" (in en). Journal of Number Theory 106 (2): 275–284. doi:10.1016/j.jnt.2003.11.009. ISSN 0022-314X. 
  9. ↑ Habsieger, Laurent; Roblot, Xavier-Franc¸ois (2006). "On integers of the form [math]\displaystyle{ p+2^k }[/math]". Acta Arithmetica 1: 45–50. doi:10.4064/aa122-1-4. https://hal.archives-ouvertes.fr/hal-00863145/document. 
  10. ↑ Habsieger, Laurent; Sivak-Fischler, Jimena (2010-12-01). "An effective version of the Bombieri–Vinogradov theorem, and applications to Chen's theorem and to sums of primes and powers of two" (in en). Archiv der Mathematik 95 (6): 557–566. doi:10.1007/s00013-010-0202-5. ISSN 1420-8938. 
  11. ↑ Rieger, G. J. (1961-02-01). "Verallgemeinerung zweier Sätze von Romanov aus der additiven Zahlentheorie" (in de). Mathematische Annalen 144 (1): 49–55. doi:10.1007/BF01396540. ISSN 1432-1807. 
  12. ↑ Shparlinski, Igor E.; Weingartner, Andreas J. (2015-10-30). "An explicit polynomial analogue of Romanoff's theorem". arXiv:1510.08991 [math.NT].
  13. ↑ Madritsch, Manfred G.; Planitzer, Stefan (2018-01-08). "Romanov's Theorem in Number Fields". arXiv:1512.04869 [math.NT].



Retrieved from "https://handwiki.org/wiki/index.php?title=Romanov%27s_theorem&oldid=3361477"