Related papers: Prime number races with three or more competitors

Let $a_1$, $a_2$, and $a_3$ be distinct reduced residues modulo $q$ satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \pmod q$. We conditionally derive an asymptotic formula, with an error term that has a power savings in $q$, for…

Rubinstein and Sarnak have shown, conditional on the Riemann hypothesis (RH) and the linear independence hypothesis (LI) on the non-real zeros of $\zeta(s)$, that the set of real numbers $x\ge2$ for which $\pi(x)>$ li$(x)$ has a logarithmic…

Under certain plausible assumptions, M. Rubinstein and P. Sarnak solved the Shanks--R\'enyi race problem, by showing that the set of real numbers $x\geq 2$ such that $\pi(x;q,a_1)>\pi(x;q,a_2)>...>\pi(x;q,a_r)$ has a positive logarithmic…

Fix a prime $p >2$ and a finite field $\mathbb{F}_{q}$ with $q$ elements, where $q$ is a power of $p$. Let $m$ be a monic polynomial in the polynomial ring $\mathbb{F}_{q}[T]$ such that $deg(m)$ is large. Fix an integer $r\geq 2$, and let…

Rubinstein and Sarnak investigated systems of inequalities of the form pi(x;q,a_1) > ... > pi(x;q,a_r), where pi(x;q,a) denotes the number of primes up to x that are congruent to a mod q. They showed, under standard hypotheses on the zeros…

Chebyshev was the first to observe a bias in the distribution of primes in residue classes. The general phenomenon is that if $a$ is a nonsquare\mod q and $b$ is a square\mod q, then there tend to be more primes congruent to $a\mod q$ than…

We investigate the race between prime numbers in many residue classes modulo $q$, assuming the standard conjectures GRH and LI. Among our results we exhibit, for the first time, prime races modulo $q$ with $n$ competitor classes where the…

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…

We provide a formula for the logarithmic density of the set of positive real numbers on which two prime counting functions $\psi(x;q,a)$ and $\psi(x;q,b)$ are simultaneously larger than their asymptotic main terms, as well as a method for…

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

We continue to investigate the race between prime numbers in many residue classes modulo $q$, assuming the standard conjectures GRH and LI. We show that provided $n/\log q \rightarrow \infty$ as $q \rightarrow \infty$, we can find $n$…

Let $q\geq 3$, $2\leq r\leq \phi(q)$ and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. Assuming the Generalized Riemann Hypothesis and the Grand Simplicity Hypothesis, M. Rubinstein and P. Sarnak…

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 investigate races among prime ideals in number fields when there are two or more competing conjugacy classes. In their work [4], Fiorilli and Jouve studied two-way races in number fields and showed that-unlike the classical setting of…

In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

We show, for any $q\ge 3$ and distinct reduced residues $a,b \pmod q$, the existence of certain hypothetical sets of zeros of Dirichlet $L$-functions lying off the critical line implies that $\pi(x;q,a)<\pi(x;q,b)$ for a set of real $x$ of…

Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…

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…

In this paper, we study an asymptotic distribution of sets of primes satisfying certain "linking conditions" in arithmetic topology, namely, conditions given by the Legendre and R\'edei symbols among sets of primes. As our Main Theorem, we…