An Asymptotic Formula for the Chebyshev Theta Function
Abstract
Let \pn\n 1 be the sequence of primes and (x) = Σp ≤ x p, where p runs over the primes not exceeding x, be the Chebyshev -function. In this note we derive lower and upper bounds for (pn)/n by comparing it with pn+1 and deduce that (pn)/n= pn+1(1-1 n+ n2 n(1+o(1))).
0