AThe exact limit lim_{x→∞} π(x) / (x/ln x) = 1, confirming the Prime Number Theorem
Bπ(x) grows faster than x/ln(x) for sufficiently large x
Cπ(x) is trapped between constant multiples of x/ln(x), proving it has the correct order of magnitude without pinning down the exact constant
DElementary methods can fully characterize prime distribution without complex analysis
Chebyshev proved that A·(x/ln x) < π(x) < B·(x/ln x) for explicit constants A ≈ 0.92 and B ≈ 1.105. This establishes the correct order of magnitude — primes are neither much denser nor much sparser than x/ln(x) predicts — but it does not prove the limiting ratio is exactly 1. That sharper result (option A) is the Prime Number Theorem, proved by Hadamard and de la Vallée Poussin in 1896 using complex analysis. Option D overstates what Chebyshev achieved.
Question 2 Multiple Choice
Chebyshev's argument uses the central binomial coefficient C(2n, n). The key structural reason this quantity is useful for bounding π(n) is:
AC(2n, n) equals exactly π(2n) − π(n), giving a direct prime count
BEvery prime between n and 2n divides C(2n, n), while C(2n, n) ≤ 4ⁿ bounds how large the product of such primes can be
CC(2n, n) is always prime, making its factorization trivial
DThe central binomial coefficient satisfies C(2n, n) = 2ⁿ for all n, providing a sharp upper bound
Each prime p with n < p ≤ 2n divides the numerator (2n)! but not the denominator (n!)², so it divides C(2n, n). This means the product of all such primes divides C(2n, n). Meanwhile, C(2n, n) ≤ 4ⁿ because it is one of the 2n+1 terms summing to (1+1)^{2n} = 4ⁿ. Combining the lower bound (product of primes in (n, 2n]) with the upper bound 4ⁿ forces the count of primes in (n, 2n] to stay within logarithmic bounds — the core of Bertrand's postulate and Chebyshev's argument.
Question 3 True / False
Chebyshev's elementary bounds were sufficient to prove the Prime Number Theorem — that π(x)/(x/ln x) → 1 as x → ∞.
TTrue
FFalse
Answer: False
This is the key limitation of Chebyshev's approach. His elementary combinatorial argument (using central binomial coefficients) established that π(x) has the right order of magnitude — sandwiched between constant multiples of x/ln x — but could not pin down the constant. The Prime Number Theorem, which asserts the limiting ratio is exactly 1, was proved in 1896 by Hadamard and de la Vallée Poussin using properties of the Riemann zeta function and complex analysis. Elementary methods were insufficient, illustrating a general principle: exact asymptotics require deeper analytic machinery than correct magnitude estimates.
Question 4 True / False
Bertrand's postulate — that there is always a prime between n and 2n — can be derived from Chebyshev's style of argument about C(2n, n).
TTrue
FFalse
Answer: True
This follows from the same central binomial coefficient argument. If there were no prime between n and 2n, then C(2n, n) would have no prime factors in the range (n, 2n], making C(2n, n) too small to be as large as 4ⁿ/2n (a lower bound that can be established separately). The contradiction proves some prime must exist in every interval (n, 2n]. Chebyshev's more refined argument extends this to get the explicit bounds on π(x), but Bertrand's postulate is essentially the qualitative core.
Question 5 Short Answer
What is the significance of the gap between Chebyshev's bounds and the Prime Number Theorem? What did Chebyshev achieve, and what remained open?
Think about your answer, then reveal below.
Model answer: Chebyshev proved that π(x) has the same order of magnitude as x/ln(x) — that primes thin out at roughly this rate — using only elementary combinatorics (central binomial coefficients). He established explicit constants 0.92 < π(x)/(x/ln x) < 1.105 for large x. What remained open was proving the limit equals exactly 1. This required the Prime Number Theorem, proved only in 1896 using the Riemann zeta function and complex analysis. The gap illustrates that knowing the correct magnitude (order of growth) and knowing the exact asymptotic constant are fundamentally different problems requiring different tools.
The gap between Chebyshev's result and the PNT is a landmark in the history of analytic number theory. It showed that elementary combinatorics can capture qualitative prime distribution but that quantitative precision requires analytic methods — specifically, information about the zeros of ζ(s) in the complex plane. This motivated decades of work connecting prime distribution to complex function theory, culminating in the PNT and eventually in the still-open Riemann Hypothesis.