Related papers: Efficient prime counting and the Chebyshev primes

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…

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…

We introduce the weighted prime sum $S(x) = \sum_{p \le x} \sqrt{(\log p)/p}$ and the derived quantity $E(x) = S(x)^2 - M(x)$, where $M(x) = \sum_{p \le x} (\log p)/p$. We prove that the order-of-magnitude estimate $S(x) \asymp \sqrt{x /…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

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…

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.

In this paper we discuss the generalizations of the concept of Chebyshev's bias from two perspectives. First we give a general framework for the study of prime number races and Chebyshev's bias attached to general $L$-functions satisfying…

We show the following bounds on the prime counting function $\pi(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{\pi(x)}{x / \log x} \geq \liminf_{x \rightarrow…

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…

Using some simple combinatorial arguments, we establish some new estimates for the prime counting function and its allied functions. In particular we show that \begin{align}\pi(x)=\Theta(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber…

We prove that the Riemann hypothesis is equivalent to the condition $\int_{2}^x\left(\pi(t)-\text{li}(t)\right)\mathrm{d}t<0$ for all $x>2$. Here, $\pi(t)$ is the prime-counting function and $\text{li}(t)$ is the logarithmic integral. This…

The prime counting function inequality $\pi(x+y) < \pi(x)+\pi(y)$, which is known as Hardy-Littlewood conjecture, has been established for a variety of cases such as $ \delta x \leq y \leq x$, where $0< \delta \leq 1$, and $x \leq y\leq x…

Let $\pi_{q,a}(x)$ denote the number of primes $\le x$ in the progression $a$ modulo $q$. We study subtle inequities in these functions, with $q$ fixed and variable $a$ (sometimes called 'prime race problems'). It is known unconditionally…

This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…

We note an interesting and under-expressed fact from Chebyshev's initial bounding for the prime counting function, $\pi(x) := \# \{p \leq x : p \text{ prime}\},$ based upon a selection of fixed coefficients $d\in D$ to show $\psi(x) \asymp…

We provide new sufficient conditions for Chebyshev estimates for Beurling generalized primes. It is shown that if the counting function $N$ of a generalized number system satisfies the $L^{1}$-condition $$…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

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) =…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…