Prescribin the binary digits of the primes, II
Abstract
We obtain the expected asymptotic formula for the number of primes p<N=2n with r prescribed (arbitrarly 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 n)4/7.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.