Related papers: Explicit Interval Estimates for Prime Numbers
We prove that if $x$ is large enough, namely $x\ge x_0$, then there exists a prime between $x(1- \Delta^{-1})$ and $x$, where $\Delta$ is an effective constant computed in terms of $x_0$. This improves some previous results of Ramar\'e and…
The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…
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…
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…
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…
Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory…
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 use the Prime Number Theorem to prove the existence of zero-free strips for the Riemann-zeta function. Precisely, we prove that there exists $\delta>0$ for which if $0\leq r<\delta $ then $\zeta(s)\neq 0$ for Re$(s)>1-r$.
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…
We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.
This paper gives an explicit version of Selberg's 1943 mean-value estimate for the prime number theorem in intervals under the Riemann hypothesis. Two applications are given: for primes in short intervals, and Goldbach numbers (sums of two…
We present an explicit formula for a weighted sum over the zeros of the Riemann zeta function. This weighted sum is evaluated in terms of a sum over the prime numbers, weighted with help of the Hermite polynomials. From the explicit formula…
We give an informal survey of the historical development of computations related to prime number distribution and zeros of the Riemann zeta function.
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…
In this article, we derive a Euler prime product formula for the magnitude of the Riemann zeta function $\zeta(s)$ valid for $\Re(s)>1$, as well as similar formulas for $\zeta(s)$ valid for an even and odd $k$th positive integer argument.…
Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.
We consider the real part $\Re(\zeta(s))$ of the Riemann zeta-function $\zeta(s)$ in the half-plane $\Re(s) \ge 1$. We show how to compute accurately the constant $\sigma_0 = 1.19\ldots$ which is defined to be the supremum of $\sigma$ such…
The author sharpens a result of Jia (1996), showing that the interval $[n, n+n^{\frac{1}{21.5}+\varepsilon}]$ contains prime numbers for almost all $n$. Watt's mean value bound, a delicate sieve decomposition and more accurate estimates for…
Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…