Related papers: Chebyshev's bias and generalized Riemann hypothesi…

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…

We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…

It has been well-observed that an inequality of the type $\pi(x;q,a) > \pi(x;q,b)$ is more likely to hold if $a$ is a non-square modulo $q$ and $b$ is a square modulo $q$ (the so-called ``Chebyshev Bias''). For instance, each of…

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

Chebyshev observed in a letter to Fuss that there tends to be more primes of the form $4n+3$ than of the form $4n+1$. The general phenomenon, which is referred to as Chebyshev's bias, is that primes tend to be biased in their distribution…

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…

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…

Let $W$ be a smooth test function with compact support in $(0,\infty)$. Conditional on the Generalized Riemann Hypothesis for Hecke $L$-functions over $\mathbb{Q}(\omega)$, we prove that $$\sum_{p \equiv 1 \pmod{3}} \frac{1}{2 \sqrt{p}}…

The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…

Chebyshev presented a conjecture after observing the apparent bias towards primes congruent to $3\pmod 4$. His conjecture is equivalent to a version of the Generalised Riemann Hypothesis. Fujii strengthened this conjecture; we strengthen it…

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

The effective version of Chebotarev's density theorem under the Generalized Riemann Hypothesis and the Artin conjecture (cf. Iwaniec and Kowalski's Analytic Number Theory, 5.13) involves a numerical invariant of a subset $D$ of a finite…

Reasons for the emergence of Chebyshev's bias were investigated. The Deep Riemann Hypothesis (DRH) enables us to reveal that the bias is a natural phenomenon for achieving a well-balanced disposition of the whole sequence of primes, in the…

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

Let $\pi(x;q,a)$ denote the number of primes up to $x$ that are congruent to $a$ modulo $q$. A prime number race, for fixed modulus $q$ and residue classes $a_1, \ldots, a_r$, investigates the system of inequalities $\pi(x;q,a_1) >…

Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers < x that are in a given arithmetic progression modulo q and the product of two primes. The two assumptions are (i) the…

In the present paper, we prove that the generalized Riemann hypothesis for the Dirichlet $L$-function $L(s,\chi)$ is equivalent to the following bound: Let $k \geq 1$ and $\ell$ be positive real numbers. For any $\epsilon >0$, we have…

The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…

Chebyshev famously observed empirically that more often than not, there are more primes of the form $3 \bmod 4$ up to $x$ than of the form $1 \bmod 4$. This was confirmed theoretically much later by Rubinstein and Sarnak in a logarithmic…

Prime counting functions are believed to exhibit, in various contexts, discrepancies beyond what famous equidistribution results predict; this phenomenon is known as Chebyshev's bias. Rubinstein and Sarnak have developed a framework which…