Prescribin the binary digits of the primes, II

2013/07/01 by Bourgain, Jean
#11N05 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1307.0398

Abstract

We obtain the expected asymptotic formula for the number of primes p0. This result improves on our earlier result where r was assumed to satisfy r

Related

• Prescribing the binary digits of primes
• On a sequence involving the prime numbers
• Digits of primes
• A prime number theorem for the majority function
• Prime numbers in typical Continued Fraction Expansions