Every odd number greater than $1$ is the sum of at most five primes
From MaRDI portal
Publication:2871196
DOI10.1090/S0025-5718-2013-02733-0zbMath1318.11126arXiv1201.6656WikidataQ56137579 ScholiaQ56137579MaRDI QIDQ2871196
Publication date: 22 January 2014
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.6656
Estimates on exponential sums (11L07) Goldbach-type theorems; other additive questions involving primes (11P32) Applications of the Hardy-Littlewood method (11P55) Applications of sieve methods (11N36) Sums over primes (11L20)
Related Items (12)
An explicit density estimate for Dirichlet $L$-series ⋮ PRIME NUMBERS: AN ALTERNATIVE STUDY USING OVA-ANGULAR ROTATIONS ⋮ On multiplicative functions which are additive on sums of primes ⋮ Upper triangular matrices over information algebras ⋮ Computers as a novel mathematical reality. IV: The Goldbach problem ⋮ DECIDABILITY AND CLASSIFICATION OF THE THEORY OF INTEGERS WITH PRIMES ⋮ Zeta functions and asymptotic additive bases with some unusual sets of primes ⋮ Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸ ⋮ New bounds for $\psi (x)$ ⋮ Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis ⋮ Oriented bipartite graphs and the Goldbach graph ⋮ The Riemann hypothesis is true up to 3·1012
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Bombieri's asymptotic sieve
- Montgomery's weighted sieve for dimension two
- Additive properties of dense subsets of sifted sequences
- Short effective intervals containing primes
- Exponential sums over primes and the prime twin problem
- On triples in arithmetic progression
- Restriction theory of the Selberg sieve, with applications
- Eigenvalues in the large sieve inequality
- Topics in multiplicative number theory
- Approximate formulas for some functions of prime numbers
- Verifying the Goldbach conjecture up to 4⋅10¹⁴
- Distribution of zeros of Dirichlet L-functions and an explicit formula for ψ(t, χ)
- Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
- Short effective intervals containing primes in arithmetic progressions and the seven cubes problem
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
- The large sieve
- The analytic principle of the large sieve
- A complete Vinogradov 3-primes theorem under the Riemann hypothesis
- Explicit upper bounds for exponential sums over primes
- Estimates of $\theta(x;k,l)$ for large values of $x$
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
- On the Vinogradov bound in the three primes Goldbach conjecture
- On Šnirelman's constant under the Riemann hypothesis
- Primes in arithmetic progressions
- Computing $\pi (x)$ analytically
- On primes in arithmetic progressions
- The large sieve
- A Note on the Large Sieve
- Explicit Bounds for Some Functions of Prime Numbers
This page was built for publication: Every odd number greater than $1$ is the sum of at most five primes
