New fast methods to compute the number of primes smaller than a given value (Q6038876)

The author of the paper describes new fast algorithms intended for the prime counting function \(\pi(x)=\sum_{p\leqslant x}1\) evaluation inspired by the harmonic and geometric mean integrals. According to the author, these algorithms can be used on any pocket calculator. Algorithms are based on the theoretical statements. Among other statements, it is shown that \[ \lim_{x\to\infty}\frac{\pi(x)}{g_h(x)}=1, \] where \[ g_h(x)=(x-2)\exp\left\{\frac{2\log\log 2-x\log\log x+h(x)}{x-2}\right\}, \] and \[ h(x)=\frac{(x-2)^2}{x(\log x-1)-2(\log 2-1)}. \]