Write and for the two Chebyshev functions, and for the prime-counting function. If , the prime divides the central binomial coefficient . Consequently
Sum this inequality over dyadic integers . It gives . Monotonicity, with , gives for real . This is the Chebyshev estimate from central binomial coefficients; no information about the distribution of primes beyond unique factorization has been used.
Split the primes at . For , , so
Since ,
We also need . The contributions of higher prime powers satisfy
because only contribute, and for .
The Von Mangoldt divisor identity is , which follows by factoring into prime powers. Summing it for , with a positive integer, gives
The bound already proved makes the last error . Integral comparison for , or the Stirling formula, gives . Therefore
The contribution from higher prime powers is uniformly bounded:
Subtract it, and replace by , to obtain the Mertens first theorem
Now fix . Apply partial summation to and . With the lower endpoint interpreted as , so that the prime is included, this gives
The boundary term tends to zero, and the integral converges, since and . Thus the series converges for every positive . Keeping the main term of also gives the useful logarithmically weighted reciprocal-prime tail
Indeed, subtract the finite partial sum from the limiting integral: the boundary contributes and the main integral contributes .