The large sieve with prime moduli (Q2692511)

In the paper under review, the author obtains large sieve type estimates of true order of magnitude for character sums to prime moduli. Letting \(L=\log Q\), \(N\leq Q^2/L^8\), and \(D=Q/\sqrt{N}\), he proves that \[ \sum_{\substack{q\leq Q\\ q~\mathrm{prime}}}{\sum_{a\,\mathrm{mod}\,q}}^\ast\,\Big|\sum_{\substack{n\leq N\\ \gcd(n,P)=1}}a_n\,e\Big(\frac{an}{q}\Big)\Big|^2\ll\frac{(1+\delta)Q^2}{\log D}\sum_{\substack{n\leq N\\ \gcd(n,P)=1}}|a_n|^2, \] where \(P\) is any positive integer, \(\sum^\ast\) denotes the sum running over primitive characters, \(e(x)=e^{2\pi i x}\), and \(\delta=(\log\log Q)^{5/2}\prod\sqrt{1-1/p}\), with the product over \(p|P\) and \(p<D\). Moreover, the author provides some modifications of the above approximation to use in some forthcoming applications. Finally, he lists some results with comments and proofs which are known in the literature in different forms.