Integers free of small prime factors in arithmetic progressions (Q4953055)

Denoting by \(\Phi(x,y;a,q)\) the number of positive integers \(n\leq x\) free of prime factors less than \(y\) and such that \(n\equiv a[q]\), the main result of this paper is the asymptotic \[ \Phi(x,y;a,q)=\Phi(x,y;1,1)/\varphi(q)+ O(\exp(-\tfrac 12\sqrt{\log x})) \] if \((a,q)=1\) and the modulus \(q\) is not exceptional, while an additional main term also provided by this paper is to be added if the modulus is exceptional. This holds in the range \(\log q\leq c_3\min(\sqrt{\log x},\log y/\log x)\) and \(y\leq x/q\), provided all prime factors of \(q\) are less than \(y\). Such a result improves though on a smaller range the classical sieve estimate (see Theorem~2.5, Chapter~2 of \textit{H.~Halberstam} and \textit{H.-E.~Richert} [Sieve Methods, Academic Press, London (1974; Zbl 0298.10026)]). The method goes via a decomposition in character sums which are evaluated through Perron's formula. The relevant Dirichlet series is written as \(L(s,\chi)/L(s,\chi;y)\), where \(L(s,\chi;y)\) is formed from the truncated Euler product of \(L(s,\chi)\), and information on \(L(s,\chi;y)\) is obtained by integrating its logarithmic derivative. The paper is well presented and well documented.