The second follows from the definition of the totient function while the third follows from the prime number theorem. What this means, essentially, is that the totient density of primorials is strictly decreasing to zero. Let me explain.

Primorials are important because they essentially "sieve" through prime numbers. For example, every prime number can also be written in the form of \(6n \pm 1\). Likewise, they can be written in the forms \(30n \pm 1, 30n \pm 7, 30n \pm 11, 30n \pm 13\). This continues for all other primorials.

But what's so special about those? We can also write primes as \(4n \pm 1, 10n \pm (1, 3)\), and so on. What's really important is minimizing the number of residue classes we have. In this light, we can imagine that there are some numbers which work better than others. For example, the prime number residue classes of \(7\) are \(\pm 1, \pm 2, \pm 3\). So we could write prime numbers in the form of \(7n \pm(1,2,3)\), but why bother when we can write them as \(6n \pm 1\) and reduce the total number of residue classes from \(\phi(7)=6\) to \(\phi(6)=2\)?

This is where the \(\phi (n) / n\) term comes from in the equation above. It measures the number of residue classes of \(n\) relative to its size. Primorials are important because they optimize this measure and occupy its minimum values.

A unique application of primorials is in calculating heuristics about the gaps between prime numbers. I'll develop this fully in a later note, but the general argument is as follows:

Take a prime number of the form \(6n + x\) and write out the next prime that comes after it. There are 4 possibilities:

The gap is divisible by \(2\) in all cases, which is a trivial fact. In half of the cases, it is divisible by \(3\). If we look at larger residue classes, we find that gaps are divisible by \(5\) in a third of cases and so on. Assuming that s is minimal (looking only at twin primes, cousin primes, and sexy primes), we can also use this heuristic to state that sexy primes (prime pairs with a gap of \(6\)) are about twice as common as twin and cousin primes (those with gaps \(2\) and \(4\), respectively).

Comments

So, if the heuristic relates the occurences of prime pairs with gaps 2, 4, 6, ..., would a solution to the twin prime conjecture also prove that there are infinitely many prime pairs with any gap? Or is the heuristic too inaccurate for that?

It would strongly suggest it, but it's still too weak to prove it. For example, we currently know that there is at least 1 prime gap below 246 which occurs infinitely often, but not which one it is. If de Polignac's conjecture is true (I believe it is), then the existence of one infinitely frequent prime gap ensures the existence of all of them - but it's based solely on heuristic arguments so far and has yet to be proven rigorously.