Related papers: The Error Term In The Primes Counting Function

Assume the Riemann hypothesis throughout. We obtain some new estimates for the size of the set of large values of the error term in the prime number theorem. Our argument is based on an analysis of the behavior of zeros of the Riemann zeta…

We provide for a wide class of zero-free regions an upper bound for the error term in the Prime Number Theorem, refining works of Pintz (1980), Johnston (2024), and R\'ev\'esz (2024). Our method does not only apply to the Riemann zeta…

We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…

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…

We demonstrate the impact of a generic zero-free region and zero-density estimate on the error term in the prime number theorem. Consequently, we are able to improve upon previous work of Pintz and provide an essentially optimal error term…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

Let $\sigma+i\gamma$ be a zero of the Riemann zeta function to the right of the line $\frac{1}{2}+it$. We show that this zero causes large oscillations of the error term of the prime number theorem. Our result is close to optimal both in…

We make explicit a theorem of Pintz concerning the error term in the prime number theorem. This gives an improved version of the prime number theorem with error term roughly square-root of that which was previously known. We apply this to a…

We relate the size of the error term in the Hardy-Littlewood conjectured formula for the number of prime pairs to the $L^{1}$ norm of an exponential sum over the primes formed with the von Mangoldt function.

In this paper, we will give some estimation for the average error of the prime number theorem.

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…

Of what use are the zeros of the Riemann zeta function? We can use sums involving zeta zeros to count the primes up to $x$. Perron's formula leads to sums over zeta zeros that can count the squarefree integers up to $x$, or tally Euler's…

We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…

An improved estimate is given for $|\theta(x) -x|$, where $\theta(x) = \sum_{p\leq x} \log p$. Three applications are given: the first to arithmetic progressions that have points in common, the second to primes in short intervals, and the…

We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some…

In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…

By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…

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 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 paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…