On the theory of prime producing sieves

2024/07/19 by Ford, Kevin, Maynard, James · 1 voice
#11N05 #1N35 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2407.14368

Abstract

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum ∑_p a_p over primes p, where (a_n)_x/2

Discussions

• As stated in the comments, this is tantamount to beating the parity barrier , which in the context of the $n^2 + 1$ problem, is the only remaining issue. If we can beat the parity barrier then existin [stackexchange, 6 points]

Related

• Representing an integer as the sum of a prime and the product of two small factors
• An explicit version of Chen's theorem and the linear sieve
• Almost primes and primes that are sums of two squares plus one
• Polynomial values modulo primes on average and sharpness of the larger sieve
• A Positive Lower Bound for the Sum of Log-Reciprocal Twin Prime Products via Weighted Sieve