Related papers: Primes in arithmetic progressions on average I

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…

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 investigate the approximation to the number of primes in arithmetic progressions given by Vaughan. Instead of averaging the expected error term over all residue classes to modules in a given range, here we only consider subsets of…

In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

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…

In this paper, we will give some estimation for the average error of the prime number theorem.

We study the asymptotic count of dihedral quartic extensions over a fixed number field with bounded norm of the relative discriminant. The main term of this count (including a summation formula for the constant) can be found in the…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

For certain primes $p$, the average digit in the expansion of $1/p$ was found to have a deviation from random behaviour related to the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-p})$ (Girstmair 1994). In this short…

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…

We show that for any $\varepsilon > 0$, prime $q$ sufficiently large with respect to $1 / \varepsilon$ and residue class $(a,q) = 1$, there exist two integers $m, n \leq q^{5/2 + \varepsilon}$ with $m \equiv n \equiv a \pmod{q}$ such that…

We combine a sieve method together with good uniformity estimates to prove a secondary term for the asymptotic estimate of $S_3\times A$ extensions over $\mathbb{Q}$ when $A$ is an odd abelian group with minimal prime divisor greater than…

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an…

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…

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

We give explicit numerical values with 100 decimal digits for the constant in the Mertens product over primes in the arithmetic progressions $a \bmod q$, for $q \in \{3$, ..., $100\}$ and $(a, q) = 1$.

When solving a number of problems in prime number theory, it is sufficient that $t(x;q)$ admits an estimate close to this one. The best known estimates for $t(x;q)$ previously belonged to G.~Montgomery, R.~Vaughn, and Z.~Kh.~Rakhmonov. In…