English

An Asymptotic Formula for the Chebyshev Theta Function

Number Theory 2020-01-14 v2

Abstract

Let {pn}n1\{p_n\}_{n\ge 1} be the sequence of primes and ϑ(x)=pxlogp\vartheta(x) = \sum_{p \leq x} \log p, where pp runs over the primes not exceeding xx, be the Chebyshev ϑ\vartheta-function. In this note we derive lower and upper bounds for ϑ(pn)/n\vartheta(p_n)/n by comparing it with logpn+1\log p_{n+1} and deduce that ϑ(pn)/n=logpn+1(11logn+loglognlog2n(1+o(1))).\vartheta(p_n)/n=\log p_{n+1}\left(1-\frac{1}{\log n}+\frac{\log\log n}{\log^2 n}\left(1+o(1)\right)\right).

Keywords

Cite

@article{arxiv.1902.09231,
  title  = {An Asymptotic Formula for the Chebyshev Theta Function},
  author = {Aditya Ghosh},
  journal= {arXiv preprint arXiv:1902.09231},
  year   = {2020}
}
R2 v1 2026-06-23T07:49:51.183Z