Related papers: Harmonic numbers and the prime counting function

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…

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…

This paper gives some results for the logarithm of the Riemann zeta-function and its iterated integrals. We obtain a certain explicit approximation formula for these functions. The formula has some applications, which are related with the…

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.

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…

In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.

This paper is a continuation of our recent paper with the same title, arXiv:0806.1596v1 [math.NT], where a number of integral equalities involving integrals of the logarithm of the Riemann zeta-function were introduced and it was shown that…

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

Using a generalized Littlewood theorem concerning integrals of the logarithm of analytical functions, we have established a few equalities involving integrals of the logarithm of the Riemann Zeta-function and have rigorously proven that…

If the prime numbers are pseudo-randomly distributed, then analogy with quantum systems suggests that counting primes might be modeled by a non-homogeneous Poisson process. Consequently, postulating underlying gamma statistics, more-or-less…

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 explicitly construct a diffeomorphic pair (p(x),p^{-1}(x)) in terms of an appropriate quadric spline interpolating the prime series. These continuously differentiable functions are the smooth analogs of the prime series and the prime…

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

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

We consider the problem of finding the best harmonic or analytic approximant to a given function. We discuss when the best approximant is unique, and what regularity properties the best approximant inherits from the original function. All…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

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.

We consider the pointwise approximation of a subharmonic function by the logarithm of the modulus of an entire function up to a bounded quantity. In the case of finite order an estimate from below of the planar Lebesgue measure of an…

A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.

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…