It's quite some time since we arrived at Riemann's main result, the explicit formula

where is the prime power counting function introduced even earlier. It's high time we applied this!

First, let's take a look at when calculating it exactly:

It's quite some time since we arrived at Riemann's main result, the explicit formula

where is the prime power counting function introduced even earlier. It's high time we applied this!

First, let's take a look at when calculating it exactly:

The question may sound silly, but I hope it will become apparent that it's very reasonable to ask. What we will examine here is the *probabilistic interpretation* of the prime distribution. So, essentially we ask: "What's the probability that a randomly chosen number is prime?" Those familiar with some basic probability theory know the notion of independency in this context, so the question I'm basically interested in here is if the probability to find a prime is independent of the preceding or following numbers. This post is a little out of the regular narrative, but it's something I have been thinking about recently, and I think it makes a cute article.

But one step back. First consider the following problem: We pick a number not exceeding some (large) at random. What are the odds this number is prime? Well, this is a classic example of a discrete probability, so the answer is *positive cases over all cases*, i.e.,

where denotes the set of all primes, and is the prime counting function, i.e., the number of primes not exceeding . Now, the famous Prime Number Theorem states that we can approximate with the elementary function

Don't worry too much about the exact meaning of the tilde, we will have plenty of opportunity to examine it further. For now just read it as "the left-hand side behaves similarly to the right-hand side". Now we can substitute this approximation in the calculation of the probability above, and obtain

Continue reading Are Primes Independent?