Related papers: New bounds in R.S. Lehman's estimates for the diff…

We reduce the leading term in Lehman's theorem. This improved estimate allows us to refine the main theorem of Bays and Hudson. Entering $2,000,000$ Riemann zeros, we prove that there exists $x$ in the interval $[exp(727.951858),…

It is known, that under the assumption of the generalized Riemannian hypothesis, the function $\pi(x, q, 1) - \pi(x, q, a)$ has infinitely many sign changes. In this article we give an upper bound for the least such sign change. Similarly,…

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function $\psi(x)$ to bounds of the same type on both $\theta(x)$ and $\pi(x)$. This follows up our previous work on $\psi(x)$ in…

By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…

Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…

In this paper, we establish new bounds for classical prime-counting functions. All of our bounds are explicit and assume the Riemann Hypothesis. First, we prove that $|\psi(x) - x|$ and $|\vartheta(x) - x|$ are bounded from above by…

We improve the lower bound for $V(T)$, the number of sign changes of the error term $\psi(x)-x$ in the Prime Number Theorem in the interval $[1,T]$ for large $T$. We show that \[ \liminf_{T\to\infty}\frac{V(T)}{\log…

In this paper we establish a number of new estimates concerning the prime counting function \pi(x), which improve the estimates proved in the literature. As an application, we deduce a new result concerning the existence of prime numbers in…

Let $S(t) = \tfrac{1}{\pi} \arg \zeta (\frac12 + it)$ be the argument of the Riemann zeta-function at the point $\tfrac12 + it$. For $n \geq 1$ and $t>0$ define its iterates \begin{equation*} S_n(t) = \int_0^t S_{n-1}(\tau) \,{\rm d}\tau\,…

Let pi(x) denote the number of primes smaller or equal to x. We compare sqrt{pi}(x) with sqrt{R}(x) and sqrt{li}(x), where R(x) and li(x) are the Riemann function and the logarithmic integral, respectively. We show a regularity in the…

Let $V(T)$ denote the number of sign changes in $\psi(x) - x$ for $x\in[1, T]$. We show that $\liminf_{\;T\rightarrow\infty} V(T)/\log T \geq \gamma_{1}/\pi + 1.867\cdot 10^{-30}$, where $\gamma_{1} = 14.13\ldots$ denotes the ordinate of…

Evaluating the statistical dimension is a common tool to determine the asymptotic phase transition in compressed sensing problems with Gaussian ensemble. Unfortunately, the exact evaluation of the statistical dimension is very difficult and…

Standard prime-number counting functions, such as $\psi(x)$, $\theta(x)$, and $\pi(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $\pi_r(x) =…

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

Two topics of the number theory are discussed in this paper. First, we prove that given each natural number $x\geq10^{3}$, we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where $c$…

Let $\pi S(t)$ denote the argument of the Riemann zeta-function at the point $s=\tfrac12+it$. Assuming the Riemann hypothesis, we give a new and simple proof of the sharpest known bound for $S(t)$. We discuss a generalization of this bound…