← back February 13, 2026 One of the oldest theorems in mathematics is that there are infinitely many primes. Euclid (the geometer!) proved this around 300 BCE, and for centuries afterwards the story ended there. There are infinitely many primes -- so what else is there to ask about them? However, some infinite sets are more `common' than others. For example, even numbers are pretty common, but powers of 2 are pretty rare: between \(1\) and \(1000,\) there are 500 even numbers, but only ten powers of 2. Thus, an interesting follow up question to Euclid's proof is to ask: can we quantify how common prime numbers are?…