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:
We've seen the calculus version
of the Euler product, and we know how to express as a product over its roots
High time we put everything together -- the reward will be the long expected explicit formula for counting primes! Continue reading Integral Madness
After all this playing with the -function it is time to return to the overall objective of this whole exercise: counting prime numbers. The idea behind analytic number theory is that primes are unpredictable on the small scale, but actually surprising regular on the large scale. This is why we'll look at certain functions that behave pretty erratically when we look at every single value, but become smooth and "easy" to calculate once we "zoom out" and consider the global properties, the so-called asymptotic. Continue reading Counting Primes Functionally
We've seen that satisfies the functional equation
(Well, it still needs to be proved, but let's just assume it's correct for now.) The goal of this post is an even more symmetrical form that will yield the function which we can develop into an incredibly useful product expression.
On our wish list for we find three items: