Products of primes in arithmetic progressions

Abstract

A conjecture of Erdős states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that, for any sufficiently large cube-free integer $q$, every reduced residue class $\pmod q$ can be written as $p_1p_2p_3$ with $p_1,p_2,p_3\leq q$ primes. We also show that, for any $\varepsilon > 0$ and any sufficiently large integer $q$, at least $(2/3-\varepsilon)\varphi(q)$ reduced residue classes $\pmod q$ can be represented as a product $p_1 p_2$ of two primes $p_1, p_2 \leq q$. The problems naturally reduce to studying character sums. The main innovation in the paper is the establishment of a multiplicative dense model theorem for character sums over primes in the spirit of the transference principle. In order to deal with possible local obstructions we use bounds for the logarithmic density of primes in certain unions of cosets of subgroups of $\mathbb{Z}_q^\times$ of small index and study in detail the exceptional case that there exists a quadratic character $ψ\pmod{q}$ such that $ψ(p) = -1$ for almost all primes $p \leq q$.

Theorems & Definitions (52)

• Theorem 1.1
• Remark 1.2
• Theorem 1.3
• Lemma 3.1
• Lemma 3.2
• proof
• Lemma 3.3: The number of products of at most two primes in cosets
• proof
• Lemma 3.4
• proof