The elementary Selberg sieve and bounded prime gaps

What's new

This post is a continuation of the previous post on sieve theory, which is an ongoing part of the Polymath8 project to improve the various parameters in Zhang’s proof that bounded gaps between primes occur infinitely often. Given that the comments on that page are getting quite lengthy, this is also a good opportunity to “roll over” that thread.

We will continue the notation from the previous post, including the concept of an admissible tuple, the use of an asymptotic parameter $latex {x}&fg=000000$ going to infinity, and a quantity $latex {w}&fg=000000$ depending on $latex {x}&fg=000000$ that goes to infinity sufficiently slowly with $latex {x}&fg=000000$, and $latex {W := prod_{p<w} p}&fg=000000$ (the $latex {W}&fg=000000$-trick).

The objective of this portion of the Polymath8 project is to make as efficient as possible the connection between two types of results, which we call $latex {DHL[k_0,2]}&fg=000000$ and $latex {MPZ[varpi,delta]}&fg=000000$. Let us first state $latex…

View original post 5,930 more words

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s