Related papers: The Error Term In The Primes Counting Function

Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the…

We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least.…

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 examine the size of $E_{2}(T)$, the error term in the asymptotic formula for $\int_{0}^{T} |\zeta(1/2 + it)|^{4}\, dt$ where $\zeta(s)$ is the Riemann zeta-function. We make improvements in the powers of $\log T$ in the known bounds for…

Assuming some regularity of the dynamical zeta function, we establish an explicit formula with an error term for the prime orbit counting function of a suspended flow. We define the subclass of self-similar flows, for which we give an…

Results of extensive computations of moments of the Riemann zeta function on the critical line are presented. Calculated values are compared with predictions motivated by random matrix theory. The results can help in deciding between those…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…

The Legendre type relation for the counting function of ordinary twin primes is reworked in terms of the inverse of the Riemann zeta function. Its analysis sheds light on the distribution of the zeros of the Riemann zeta function in the…

The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

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…

We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.

One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…

For a fixed exponent $0 < \theta \leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^\theta} \Lambda(n) \sim x^\theta$ as $x \to \infty$. From the recent zero density estimates of Guth and…

We give an informal survey of the historical development of computations related to prime number distribution and zeros of the Riemann zeta function.

In this note, we prove a power-saving remainder term for the function counting $S_3$-sextic number fields. We also give a prediction on the second main term. We also present numerical data on counting functions for $S_3$-sextic number…

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…

In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…

In 1980 Montgomery made a conjecture about the true order of the error term in the prime number theorem. In 2012 the author made an analogous conjecture for the true order of the sum of the M\"{o}bius function, $M(x)$. This refined an…