Abstract
We present a new result on counting primes p < N = 2n for which r (arbitrarily placed) digits in the binary expansion of p are specified. Compared with earlier work of Harman and Katai, the restriction on r is relaxed to r < c(n/log n)4/7. This condition results from the estimates of Gallagher and Iwaniec on zero-free regions of L-functions with ‘powerful’ conductor.
Similar content being viewed by others
References
E. Bombieri, Le grand crible dans la théorie analytique des nombres, Astérisque 18 (1987), 103 pp.
H. Davenport, Multiplicative Number Theory, Second edn., Graduate Texts in Mathematics, Vol. 74, Springer, Berlin, 1980.
P. X. Gallagher, Primes in progressions to prime-power modulus, Inventiones Mathematicae 16 (1972), 191–201.
G. Harman and I. Katai, Primes with preassigned digits II, Acta Arithmetica 133 (2008), 171–184.
H. Iwaniec, On zero’s of Dirichlet L-series, Inventiones Mathematicae 23 (1974), 97–104.
H. Iwaniec and E. Kowalski, Analytic Number Theory, American Mathematical Society Colloquium Publications, Vol. 53, American Mathematical Society, Providence, RI, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by NSF grants DMS-0808042 and DMS-0835373.
Rights and permissions
About this article
Cite this article
Bourgain, J. Prescribing the binary digits of primes. Isr. J. Math. 194, 935–955 (2013). https://doi.org/10.1007/s11856-012-0104-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-012-0104-2