Related papers: The first moment of primes in arithmetic progressi…

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 first moment of the difference between $\psi(x;q,a)$ and Vaughan's approximation, in a certain range of $q$. We show that this last approximation is significantly more precise than the classical $x/\phi(q)$, and that it…

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…

The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…

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…

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

Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example,…

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…

We establish unconditional $\Omega$-results for all weighted even moments of primes in arithmetic progressions. We also study the moments of these moments and establish lower bounds under GRH. Finally, under GRH and LI we prove an…

By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…

Let $x\geqslant 2$ and assume that $a$ and $q$ are coprime positive integers. As usual, $\psi(x;q,a):=\sum_{n\leqslant x,n\equiv a(\!\!\!\mod{\!\!q})}\Lambda(n)$, where $\Lambda$ is the von Mangoldt function. In 2003, Friedlander and…

In this paper we show that for some constant $c>0$ and for any $A>0$ there exist some $x(A)>0$ such that, If $q\leq (\log x)^{A}$ then we have \begin{align} \Psi_z(x;\mathcal{N}_q(a,b),q) &= \frac{\Theta (z)}{2\phi(q)}x +…

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…

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…

In his 1979 paper Samuel Wagstaff studied the problem of bounding the first prime in an arithmetic progression. In this paper we update a number of his computations using advances in hardware. Based on this we refine his conjecture on…

For two odd primes $p$ and $q$ such that $p<q$, let $A(p,q):=(a_k)_{k=1}^{\infty}$ be the arithmetic progression whose $k$th term is given by $a_k=(k-1)(q-p)+p$ (i.e., with $a_1=p$ and $a_2=q$). Here we conjecture that for every positive…

We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…

We show that if $\frac{L}{\varphi(q)\log X}\to\infty$ as $X\to\infty$, almost all $(a, x)\in (\mathbb Z/q\mathbb Z)^\times\times [X, 2X]$ are such that there exists a product of at most two primes in $[x, x + L]$ congruent to $a\mod{q}$.

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.

Let $E_x(q,a)$ be the error term when counting primes in arithmetic progressions and let $M(Q)=\sum_{q\leq Q}\phi(q)\sum_{a=1}^qE_x(q,a)^3$. We show that $M(Q)<<Q^3(x/Q)^{7/5}$ for large $Q$ close to $x$ (in the usual BDH sense) thereby…