Prescribing the binary digits of primes. II (Q2339608): Difference between revisions

We quote the author's summary: ``We obtain the expected asymptotic formula for the number of primes \(p < N = 2n\) with \(r\) prescribed (arbitrary placed) binary digits, provided \(r < cn\) for a suitable constant \(c > 0\). This result improves on our earlier result where \(r\) was assumed to satisfy \(r < c({n\over {\log n}})^{4/7}\).'' \quad (Note the typo `arbitrary' for `arbitrarily'). As the author remarks in Section 1, his improvement on his previous paper stems from the fact that (among other reasons) ``In the treatment of the major arcs, we switch immediately to multiplicative characters'', being ``led to study correlations of both the von Mangoldt function'' and the function that prescribes binary digits. Part I, see Isr. J. Math. 194, Part B, 935--955 (2013; Zbl 1309.11065).