Several weeks ago, I wrote a response to a question a student asked me about the value of

,

which turns out to be . We proved this result by showing that the set is dense in .

Well, the natural numbers are certainly interesting, but the subset of prime numbers are even more interesting–not to mention the engine of much curiosity in mathematics. One user on Math.StackExchange asked if the set

is dense in . The answer is yes. Proving this result will require some more sophisticated tools than before, and I will only provide a slightly more detailed outline that was suggested in the comments to the aforementioned post.

The first tool we will need is that of an *equidistributed *or *uniformly distributed* sequence of real number, which measures the proportion of elements of the sequence that a “randomly chosen” interval contains.

Def.We say that a bounded sequence of real numbers is equidistributed on an interval if, for any subinterval ,(Here, the notation denotes cardinality)

Remember that the sequence is *not *a random variable, it is determinate.

Constructing equidistributed sequences is not so easy. A simple nonexample is the sequence formed by . Indeed,

A second, less intuitive nonexample is the sequence formed by the dyadic points:

To see that this second sequence is *not *equidistributed, we make use of a theorem called Weyl’s criterion.

Theorem(Weyl) The following are equivalent:

- The sequence is equidistributed modulo .
- For any integer , .
- For any Riemann integrable function , .

Applying Weyl’s criterion with , it suffices to show that

Consider the subsequence of the sums

This result also gives us an example of a sequence which forms a dense subset modulo one but is not equidistributed modulo one.

The second tool we will need is a theorem in analytic number theory of I.M. Vinogradov. Let be the set of the primes enumerated by ascending order. In a 1935 paper, the reference for which I cannot find, Vinogradov proved that, for any irrational number , the sequence

is equidistributed modulo , or, for an interval ,

Take . Fix and . By the intermediate value theorem applied to the function , there exists such that . Since, for any given,

,

there exists a prime and an integer satisfying

,

for any given. The continuity of the sine function implies that

Pingback: Weyl’s Equidistribution Theorem | Math by Matt