What is the best approach to counting primes?

TL;DR

This paper reviews key techniques for counting primes, focusing on Riemann's influential approach, its limitations, and recent efforts to develop simpler methods for prime counting.

Contribution

It provides a comprehensive overview of prime counting methods, highlighting the evolution from Riemann's theory to newer, simpler approaches.

Findings

Riemann's method remains foundational in prime counting

Recent approaches aim to simplify prime counting techniques

The limitations of Riemann's theory motivate new research

Abstract

As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem, and the first suitable technique, due to Riemann, inspired an enormous amount of great mathematics, the techniques and insights permeating many different fields. In this article we will review some of the best techniques for counting primes, centering our discussion around Riemann's seminal paper. We will go on to discuss its limitations, and then recent efforts to replace Riemann's theory with one that is significantly simpler.