A density version of Vinogradov's three primes theorem
From MaRDI portal
Publication:3580707
Abstract: Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_iin P_i such that n=p_1+p_2+p_3.
Recommendations
Cites work
Cited in
(16)- On infinite arithmetic progressions in sumsets
- Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset
- A transference principle for systems of linear equations, and applications to almost twin primes
- Densities in certain three-way prime number races
- The ternary Goldbach problem with primes in positive density sets
- AN -FUNCTION-FREE PROOF OF VINOGRADOV’S THREE PRIMES THEOREM
- scientific article; zbMATH DE number 3030072 (Why is no real title available?)
- A density version of Waring’s problem
- scientific article; zbMATH DE number 5584063 (Why is no real title available?)
- Products of primes in arithmetic progressions
- Small-scale distribution of linear patterns of primes
- Zeta functions and asymptotic additive bases with some unusual sets of primes
- Monochromatic integers adding to polynomials of prime variables
- A density version of the Vinogradov three primes theorem
- Vinogradov's theorem with Fouvry-Iwaniec primes
- Refined Goldbach Conjectures with Primes in Progressions
This page was built for publication: A density version of Vinogradov's three primes theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580707)