Recognition: unknown
Prescribin the binary digits of the primes, II
classification
🧮 math.NT
keywords
binarydigitsprimesresultarbitrarlyassumedasymptoticconstant
read the original abstract
We obtain the expected asymptotic formula for the number of primes $p<N=2^n$ 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(\frac n{\log n})^{4/7}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.