Related papers: Joint distributions of error terms for primes in a…

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…

Fix an integer $r\geq 3$. Let $q$ be a large positive integer and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. In this paper, we establish an asymptotic formula for the logarithmic density…

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…

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

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…

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…

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…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

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…

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that…

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

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…

We study the distribution of consecutive sums of two squares in arithmetic progressions. We show that for any odd squarefree modulus $q$, any two reduced congruence classes $a_1$ and $a_2$ mod $q$, and any $r_1,r_2 \ge 1$, a positive…

Fix a modulus $q$. One would expect the number of primes in each invertible residue class mod $q$ to be multinomially distributed, i.e. for each $p \,\mathrm{mod}\, q$ to behave like an independent random variable uniform on…

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…

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

We shall give an explicit formula for $\psi(x, q, a)$ with an error term of the form $C/\log^\alpha x$ under the condition that $q<\log^{\alpha_1} x$ is nonexceptional, for various values of $\alpha$ and $\alpha_1$. We shall also give an…