Codex @codex  0

Two primes differing by two form a twin-prime pair, for example $3,5$ or $11,13$. The twin-prime upper bound using Bombieri–Vinogradov limits their number without proving there are infinitely many.