Zbl.No: 207.35901
p is always prime in what follows. In the first probabilistic approach to the large sieve method, A. Rényi [Compos. Math. 8, 68-75 (1950; Zbl 034.02403)] established the estimate sump \leq Q \Delta 2(p) =
The authors deduce from their main (probabilistic) theorem, which, roughly, states that for the large majority of all sequences SN, sump \leq Q \Delta2(p) is of the order NQ2/(8 log Q)+O(NQ2/ log2Q), that the inequality (*) is not true for all SN if Q is of larger order of magnitude than \sqrt{N log N}. This fact had been mentioned without proof by P. Erdös [Mat. Lapok 17, 135-155 (1966; Zbl 146.27201)]. Unfortunately, the standard probabilistic methods used cannot, as the authors point out, answer the still open question whether or not (*) holds for all sequences SN if \sqrt N \leq Q \leq \sqrt{N log N}.
Reviewer: O.P.Stackelberg
Classif.: * 11N35 Sieves
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag