Related papers: The error term in the prime number theorem
In this paper, we will give some estimation for the average error of the prime number theorem.
This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…
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…
Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…
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.
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 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…
We provide an explicit $O(x\log x/T)$ error term for the Riemann--von Mangoldt formula by making results of Wolke (1983) and Ramar\'e (2016) explicit. We also include applications to primes between consecutive powers, the error term in the…
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 give an explicit $O(x/T)$ error term for the truncated Riemann--von Mangoldt explicit formula. For large $x$, this provides a modest improvement over previous work, which we demonstrate via an application to a result on primes between…
We calculate the triple correlations for the truncated divisor sum $\lambda_{R}(n)$. The $\lambda_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $\Lambda(n)$ does or is conjectured to do. We also…
A celebrated theorem of Delange gives a sufficient condition for an arithmetic function to be the sum of the associated Ramanujan expansion with the coefficients provided by a previous result of Wintner. By applying the Delange theorem to…
In this article we prove a general theorem which establishes the existence of limiting distributions for a wide class of error terms from prime number theory. As a corollary to our main theorem, we deduce previous results of Wintner (1935),…
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…
The Piltz divisor problem is a natural generalization of the classical Dirichlet divisor problem. In this paper, we study this problem over number fields and obtain improved $\Omega-$bounds for its error terms. Our approach involves…
We study the error bound for a smooth weighted prime number theorem, and its implication to the zero-free region for the Riemann zeta function using the method of Pintz. We also give an application to the average number of smooth weighted…
We survey the classical results on the prime number theorem
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…
The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…
We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…