The Prime Number Theorem states π(x) ~ x/ln(x). What does the '~' (asymptotic equivalence) actually mean?
Aπ(x) equals x/ln(x) exactly for all sufficiently large x
BThe ratio π(x) / (x/ln(x)) approaches 1 as x grows without bound
Cπ(x) and x/ln(x) differ by at most a constant for all x
Dx/ln(x) is an upper bound on the number of primes below x
Asymptotic equivalence (f ~ g) means f/g → 1 as x → ∞ — not that f = g. For x = 10^6, x/ln(x) ≈ 72,400 while the true prime count is 78,498, a difference of about 8%. The ratio 78498/72400 ≈ 1.084, which approaches 1 as x → ∞. Option A is the most tempting error: the tilde does not mean equality even for large x. Options C and D describe different relationships that the theorem does not claim.
Question 2 Multiple Choice
A number is chosen uniformly at random from the integers near 10^20. According to the Prime Number Theorem, approximately what is the probability it is prime?
AAbout 1 in 20, since 10^20 has 20 digits
BAbout 1 in 46, since ln(10^20) = 20 · ln(10) ≈ 46
CAbout 1 in 400, since primes become very sparse at this scale
DEssentially zero, since primes eventually stop appearing
The PNT implies that the density of primes near x is approximately 1/ln(x). For x = 10^20, ln(10^20) = 20 · ln(10) ≈ 46. So roughly 1 in 46 numbers near 10^20 is prime. Option A confuses the number of decimal digits with the natural logarithm. Option C overestimates the sparsity — logarithmic thinning is slow. Option D is false: Euclid proved there are infinitely many primes, and the PNT shows they thin out logarithmically, not to zero.
Question 3 True / False
The logarithmic integral Li(x) = ∫₂ˣ dt/ln(t) approximates π(x) more accurately than the simpler formula x/ln(x).
TTrue
FFalse
Answer: True
Li(x) is a more accurate approximation to π(x) than x/ln(x). For x = 10^6, Li(x) ≈ 78,628 versus the true count 78,498 (error ~130), while x/ln(x) ≈ 72,400 (error ~6,100). The logarithmic integral captures the correct asymptotic behavior more precisely — its relative error decreases faster. The Riemann Hypothesis, if proved, would give explicit error bounds of the form |π(x) − Li(x)| = O(√x · ln(x)).
Question 4 True / False
The Prime Number Theorem tells us not mainly how many primes are below x, but also which specific integers below x are prime.
TTrue
FFalse
Answer: False
The PNT is a statement about density and count, not about which individual numbers are prime. It tells us π(x) ≈ x/ln(x) — the approximate total — but gives no information about which specific numbers are prime. Determining whether a particular number is prime requires separate methods: trial division, sieves, or primality tests. The PNT describes the statistical distribution of primes, not their locations.
Question 5 Short Answer
Why did proving the Prime Number Theorem require analyzing the zeros of the Riemann zeta function rather than just studying primes directly?
Think about your answer, then reveal below.
Model answer: The Riemann zeta function encodes all prime information analytically via Euler's product formula ζ(s) = ∏(1 − p^{−s})^{−1}. The distribution of primes is controlled by the locations of the zeros of ζ(s) in the complex plane. The key step in the proof is showing ζ(s) has no zeros on the line Re(s) = 1, which forces the prime counting function to follow the asymptotic x/ln(x). Direct approaches to primes hit a wall — complex analysis provides the tools to turn information about all primes simultaneously into precise asymptotic results.
The prime-counting function π(x) is related to the zeros of ζ(s) via an explicit formula. Each zero contributes an oscillatory term to the error in the approximation. Controlling where the zeros can appear is equivalent to controlling how accurately we can count primes. This is why the Riemann Hypothesis — specifying exactly where all non-trivial zeros lie — is equivalent to the sharpest possible error bounds on π(x).