Primes with restricted digits
Let a0 ∈ {0,…,9}. We show there are infinitely many prime numbers which do not have the digit a0 in their decimal expansion. The proof is an application of the Hardy–Littlewood circle method to a binary problem, and rests on obtaining suitable ‘Type I’ and ‘Type II’ arithmetic information for use in...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Published: |
Springer Berlin Heidelberg
2019
|
| _version_ | 1797083371497586688 |
|---|---|
| author | Maynard, J |
| author_facet | Maynard, J |
| author_sort | Maynard, J |
| collection | OXFORD |
| description | Let a0 ∈ {0,…,9}. We show there are infinitely many prime numbers which do not have the digit a0 in their decimal expansion. The proof is an application of the Hardy–Littlewood circle method to a binary problem, and rests on obtaining suitable ‘Type I’ and ‘Type II’ arithmetic information for use in Harman’s sieve to control the minor arcs. This is obtained by decorrelating Diophantine conditions which dictate when the Fourier transform of the primes is large from digital conditions which dictate when the Fourier transform of numbers with restricted digits is large. These estimates rely on a combination of the geometry of numbers, the large sieve and moment estimates obtained by comparison with a Markov process. |
| first_indexed | 2024-03-07T01:40:50Z |
| format | Journal article |
| id | oxford-uuid:96ca35bb-1b31-42a9-a21e-c11790f0f642 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T01:40:50Z |
| publishDate | 2019 |
| publisher | Springer Berlin Heidelberg |
| record_format | dspace |
| spelling | oxford-uuid:96ca35bb-1b31-42a9-a21e-c11790f0f6422022-03-26T23:55:18ZPrimes with restricted digitsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:96ca35bb-1b31-42a9-a21e-c11790f0f642Symplectic Elements at OxfordSpringer Berlin Heidelberg2019Maynard, JLet a0 ∈ {0,…,9}. We show there are infinitely many prime numbers which do not have the digit a0 in their decimal expansion. The proof is an application of the Hardy–Littlewood circle method to a binary problem, and rests on obtaining suitable ‘Type I’ and ‘Type II’ arithmetic information for use in Harman’s sieve to control the minor arcs. This is obtained by decorrelating Diophantine conditions which dictate when the Fourier transform of the primes is large from digital conditions which dictate when the Fourier transform of numbers with restricted digits is large. These estimates rely on a combination of the geometry of numbers, the large sieve and moment estimates obtained by comparison with a Markov process. |
| spellingShingle | Maynard, J Primes with restricted digits |
| title | Primes with restricted digits |
| title_full | Primes with restricted digits |
| title_fullStr | Primes with restricted digits |
| title_full_unstemmed | Primes with restricted digits |
| title_short | Primes with restricted digits |
| title_sort | primes with restricted digits |
| work_keys_str_mv | AT maynardj primeswithrestricteddigits |