Related papers: New bounds for $\psi(x)$

In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…

In this article, we prove an explicit bound for $N(\sigma,T)$, the number of zeros of the Riemann zeta function satisfying $\sigma < \Re s <1 $ and $0 < \Im s < T$. This result provides a significant improvement over Rosser's bound for…

In this paper we give new estimates for integrals involving some arithmetic functions defined over prime numbers. The main focus here is on the prime counting function $\pi(x)$ and the Chebyshev $\vartheta$-function. Some of these estimates…

In this article we present some improved results for Chebyshev's functions $\vartheta$ and $\psi$ using the new zero-free region obtained by H. Kadiri and the calculated the first $10^{13}$ zeros of the Riemann zeta function on the critical…

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 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}…

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…

This article provides a proof of the famous \textit{Prime Number Theorem} by establishing an analogous statement of the same in terms of the second \textit{Chebyshev Function} $\psi(x)$. We shall be extensively using complex analytic…

In this article, we provide explicit bounds for the prime counting function $\theta(x)$ in all ranges of $x$. The bounds for the error term for $\theta (x)- x$ are of the shape $\epsilon x$ and $\frac{c_k x}{(\log x)^k}$, for…

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

Let $\psi_\K$ be the Chebyshev function of a number field $\K$. Under GRH we prove an explicit upper bound for $|\psi_\K(x)-x|$ in terms of the degree and the discriminant of $\K$. The new bound improves significantly on previous known…

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

We provide new sufficient conditions for Chebyshev estimates for Beurling generalized primes. It is shown that if the counting function $N$ of a generalized number system satisfies the $L^{1}$-condition $$…

The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…

We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotar\"ev's density theorem to the cyclic case.

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

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…

In this paper we discuss the generalizations of the concept of Chebyshev's bias from two perspectives. First we give a general framework for the study of prime number races and Chebyshev's bias attached to general $L$-functions satisfying…

We note an interesting and under-expressed fact from Chebyshev's initial bounding for the prime counting function, $\pi(x) := \# \{p \leq x : p \text{ prime}\},$ based upon a selection of fixed coefficients $d\in D$ to show $\psi(x) \asymp…

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…