2000 character limit reached
Primes with a missing digit: distribution in arithmetic progressions and an application in sieve theory (2108.09212v2)
Published 20 Aug 2021 in math.NT
Abstract: We prove Bombieri-Vinogradov type theorems for primes with a missing digit in their $b$-adic expansion for some large positive integer $b$. The proof is based on the circle method, which relies on the Fourier structure of the integers with a missing digit and the exponential sums over primes in arithmetic progressions. Combining our results with the semi-linear sieve, we obtain an upper bound and a lower bound of the correct order of magnitude for the number of primes of the form $p=1+m2+n2$ with a missing digit in a large odd base $b$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.