Romanov's theorem

Last updated
Romanov's theorem
TypeTheorem
Field Additive number theory
Conjectured by Alphonse 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.

Contents

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 there are more than numbers which can be represented as the sum of a prime number and a k-th power of an integer, where is a certain positive constant that is only dependent on k" and "In every interval there are more than numbers which can be represented as the sum of a prime number and a power of a. Here a is a given integer and 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 and let , . Then Romanov's theorem asserts that . [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 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 mentioned in the case was later known as Romanov's constant. [6] Various estimates on the constant, as well as , has been made. The history of such refinements are listed below. [3] In particular, since 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 and
YearLower bound on Upper bound on ProverNotes
1950 [lower-alpha 1] Paul Erdős; [7] First proof of infinitely many odd numbers that are not of the form through
an explicit arithmetic progression
20040.0868Chen, Xun [8]
20060.09330.49094093 [lower-alpha 2] Habsieger, Roblot; [9] Considers only odd numbers; not exact, see note
20060.093626Pintz; [6] originally proved 0.9367, but an error was found and fixing it would yield 0.093626
20100.0936275Habsieger, Sivak-Fischler [10]
20180.107648Elsholtz, Schlage-Puchta
  1. ↑ Exact value is .
  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]

Related Research Articles

<span class="mw-page-title-main">Modular arithmetic</span> Computation modulo a fixed integer

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

<span class="mw-page-title-main">Perfect number</span> Integer equal to the sum of its proper divisors

In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3, and 1 + 2 + 3 = 6, so 6 is a perfect number.

<span class="mw-page-title-main">Riemann zeta function</span> Analytic function in mathematics

The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter ζ (zeta), is a mathematical function of a complex variable defined as

<span class="mw-page-title-main">Square-free integer</span> Number without repeated prime factors

In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, 10 = 2 ⋅ 5 is square-free, but 18 = 2 ⋅ 3 ⋅ 3 is not, because 18 is divisible by 9 = 32. The smallest positive square-free numbers are

In mathematics, a transcendental number is a real or complex number that is not algebraic – that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are π and e.

In number theory, Waring's problem asks whether each natural number k has an associated positive integer s such that every natural number is the sum of at most s natural numbers raised to the power k. For example, every natural number is the sum of at most 4 squares, 9 cubes, or 19 fourth powers. Waring's problem was proposed in 1770 by Edward Waring, after whom it is named. Its affirmative answer, known as the Hilbert–Waring theorem, was provided by Hilbert in 1909. Waring's problem has its own Mathematics Subject Classification, 11P05, "Waring's problem and variants".

The fundamental theorem of algebra, also called d'Alembert's theorem or the d'Alembert–Gauss theorem, states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since every real number is a complex number with its imaginary part equal to zero.

<span class="mw-page-title-main">Euler's totient function</span> Number of integers coprime to and not exceeding n

In number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. It is written using the Greek letter phi as or , and may also be called Euler's phi function. In other words, it is the number of integers k in the range 1 ≤ k ≤ n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n.

In number theory, Fermat's little theorem states that if p is a prime number, then for any integer a, the number ap − a is an integer multiple of p. In the notation of modular arithmetic, this is expressed as

Linnik's theorem in analytic number theory answers a natural question after Dirichlet's theorem on arithmetic progressions. It asserts that there exist positive c and L such that, if we denote p(a,d) the least prime in the arithmetic progression

In differential geometry, the Atiyah–Singer index theorem, proved by Michael Atiyah and Isadore Singer (1963), states that for an elliptic differential operator on a compact manifold, the analytical index is equal to the topological index. It includes many other theorems, such as the Chern–Gauss–Bonnet theorem and Riemann–Roch theorem, as special cases, and has applications to theoretical physics.

<span class="mw-page-title-main">Lagrange's four-square theorem</span> Every natural number can be represented as the sum of four integer squares

Lagrange's four-square theorem, also known as Bachet's conjecture, states that every natural number can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four.

In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Russian mathematician Lev Schnirelmann, who was the first to study it.

Chebotarev's density theorem in algebraic number theory describes statistically the splitting of primes in a given Galois extension K of the field of rational numbers. Generally speaking, a prime integer will factor into several ideal primes in the ring of algebraic integers of K. There are only finitely many patterns of splitting that may occur. Although the full description of the splitting of every prime p in a general Galois extension is a major unsolved problem, the Chebotarev density theorem says that the frequency of the occurrence of a given pattern, for all primes p less than a large integer N, tends to a certain limit as N goes to infinity. It was proved by Nikolai Chebotaryov in his thesis in 1922, published in.

In mathematics and the field of number theory, the Landau–Ramanujan constant is the positive real number b that occurs in a theorem proved by Edmund Landau in 1908, stating that for large , the number of positive integers below that are the sum of two square numbers behaves asymptotically as

In number theory, Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers. It is a weaker form of Goldbach's weak conjecture, which would imply the existence of such a representation for all odd integers greater than five. It is named after Ivan Matveyevich Vinogradov, who proved it in the 1930s. Hardy and Littlewood had shown earlier that this result followed from the generalized Riemann hypothesis, and Vinogradov was able to remove this assumption. The full statement of Vinogradov's theorem gives asymptotic bounds on the number of representations of an odd integer as a sum of three primes. The notion of "sufficiently large" was ill-defined in Vinogradov's original work, but in 2002 it was shown that 101346 is sufficiently large. Additionally numbers up to 1020 had been checked via brute force methods, thus only a finite number of cases to check remained before the odd Goldbach conjecture would be proven or disproven. In 2013, Harald Helfgott proved Goldbach's weak conjecture for all cases.

<span class="mw-page-title-main">Riemann hypothesis</span> Conjecture on zeros of the zeta function

In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann (1859), after whom it is named.

Pollock's conjectures are closely related conjectures in additive number theory. They were first stated in 1850 by Sir Frederick Pollock, better known as a lawyer and politician, but also a contributor of papers on mathematics to the Royal Society. These conjectures are a partial extension of the Fermat polygonal number theorem to three-dimensional figurate numbers, also called polyhedral numbers.

A Proth number is a natural number N of the form where k and n are positive integers, k is odd and . A Proth prime is a Proth number that is prime. They are named after the French mathematician François Proth. The first few Proth primes are

References

  1. ↑ Romanoff, N. P. (1934-12-01). "Über einige Sätze der additiven Zahlentheorie". Mathematische Annalen (in German). 109 (1): 668–678. doi:10.1007/BF01449161. ISSN   1432-1807. S2CID   119938116.
  2. ↑ Nathanson, Melvyn B. (2013-03-14). Additive Number Theory The Classical Bases. Springer Science & Business Media. ISBN   978-1-4757-3845-2.
  3. 1 2 Elsholtz, Christian; Schlage-Puchta, Jan-Christoph (2018-04-01). "On Romanov's constant". Mathematische Zeitschrift. 288 (3): 713–724. doi:10.1007/s00209-017-1908-x. ISSN   1432-1823. S2CID   125994504.
  4. ↑ de Polignac, A. (1849). "Recherches nouvelles sur les nombres premiers" [New research on prime numbers]. Comptes rendus (in French). 29: 397–401.
  5. ↑ L. Euler, Letter to Goldbach . 16-12-1752.
  6. 1 2 Pintz, János (2006-07-01). "A note on Romanov's constant". 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 and some related problems" (PDF). Summa Brasiliensis Mathematicae. 2: 113–125. S2CID   17379721. Archived from the original (PDF) on 2019-02-28.
  8. ↑ Chen, Yong-Gao; Sun, Xue-Gong (2004-06-01). "On Romanoff's constant". 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 ". Acta Arithmetica. 1: 45–50. doi: 10.4064/aa122-1-4 .
  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". Archiv der Mathematik. 95 (6): 557–566. doi:10.1007/s00013-010-0202-5. ISSN   1420-8938. S2CID   120510181.
  11. ↑ Rieger, G. J. (1961-02-01). "Verallgemeinerung zweier Sätze von Romanov aus der additiven Zahlentheorie". Mathematische Annalen (in German). 144 (1): 49–55. doi:10.1007/BF01396540. ISSN   1432-1807. S2CID   121911723.
  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].
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.