Explicit estimates of some functions over primes (Q1696816): Difference between revisions

As an explicit analogue to Landau's notation we denote the inequality \(|f(x)-g(x)|\leq h(x)\) by \(f(x)=g(x)+O^*(h(x))\). In the paper under review the author updates several known bounds concerning functions of prime numbers. First, he obtains bounds for the Chebyshev functions by proving \(\psi(x)=x+O^*(59.2 x/\log^4 x)\) and \(\theta(x)=x+O^*(151.3 x/\log^4 x)\) for \(x\geq 2\). Regarding to \(n\)-th prime, he shows for \(n\geq 178974\), \[ p_n=n\left(\log n+\log\log n-1+\frac{\log\log n -2}{\log n}+O^*\Big(\frac{0.1}{\log n}\Big)\right). \] Regarding to the primes counting function \(\pi(x)\) he shows for \(x\geq 11813\), \[ \pi(x)=\frac{x}{\log x}\left(1+\frac{1}{\log x}+\frac{2}{\log^2 x}+O^*\Big(\frac{0.53816}{\log^2 x}\Big)\right). \] Among several applications of such explicit approximations, the author considers existence of primes in short intervals, by proving that for each \(x\geq 468991632\) the interval \([x,x(1+0.0002/\log^2 x)]\) contains at least a prime. The author also updates explicit versions of Mertens' theorems by proving \[ \sum_{p\leq x}\frac{\log p}{p}=\log x+E+O^*\Big(\frac{0.3}{\log^3 x}\Big), \] \[ \sum_{p\leq x}\frac{1}{p}=\log\log x+M+O^*\Big(\frac{0.2}{\log^3 x}\Big), \] \[ \prod_{p\leq x}\left(1-\frac{1}{p}\right)=\frac{e^{-\gamma}}{\log x}\left(1+O^*\Big(\frac{0.2}{\log^3 x}\Big)\right), \] respectively for \(x\geq 912560\), \(x\geq 2278383\), and \(x\geq 2278382\), where \(E=-\gamma-\sum_{n=2}^\infty\sum_p(\log p)/p^n\) and \(M\) denotes Mertens' constant.