Distribution of numbers with a given number of prime divisors in progressions (Q1898274): Difference between revisions

Let \(\mu(x,k,t,a,d)\) be the number of integers \(n \leq x\) in the residue class \(n \equiv a \pmod d\) and having exactly \(k\) prime factors all of them \(\geq t\). Theorem 1 of the paper is an upper bound for \(\mu\) in the expected size uniform in the domain \[ k \leq (2 - \varepsilon) \log \log x, \quad d \leq x^{1/2 + 1/3k}, \quad (a,d) = 1,\;2 \leq t \leq x^{1/10 e^{- k/2}}. \] Theorem 2 of the paper is a Bombieri-Vinogradov type estimate for \(\mu\) with level of distribution \(x^{1/2 - \varepsilon}\) and uniform in the domain \(k \leq \log \log^2x\), \(2 \leq t \leq x^{1/2}\). As an application of the previous two estimates an asymptotic is established to the sum \[ \sum_{n \leq x,\;\Omega (n) = k} \tau (n - 1), \] where \(\Omega (n)\) and \(\tau (n)\) denote the number of all prime factors and the number of positive divisors of \(n\) respectively. This is a generalization of the so-called Titchmarsh divisor problem.