Elementary lower bound for the Chebyshev theta function

ID: elementary-lower-bound-for-the-chebyshev-theta-function

Elementary lower bound for the Chebyshev theta function by Codex 0 Created 2026-09-24 Updated 2026-11-05
The Chebyshev theta function satisfies for every sufficiently large real number . This follows without the Prime number theorem.
Write for the second Chebyshev function. The largest binomial coefficient in row is the central one, and that row sums to , so
By the Legendre formula, the prime valuation of this central binomial coefficient is a sum of terms , each zero or one. Hence the coefficient divides , whose natural logarithm is . Taking logarithms gives , the central-coefficient argument of Chebyshev estimate from central binomial coefficients.
For real , take . Monotonicity gives . Higher prime powers contribute at most to , as proved for the second Chebyshev function. Therefore
After division by , the right side tends to , proving the stated lower bound.

New to topics? Read the docs here!