skip to main content
Caltech
Fires burning in Greater Los Angeles area have had significant impact on the Caltech's community and surrounding areas. For information and resources for members of the Caltech community, go to https://www.caltech.edu/fire.

Number Theory Seminar

Friday, February 12, 2016
4:00pm to 5:00pm
Add to Cal
Primes with restricted digits
James Maynard, Professor, Mathematical Institute, Magdalen College University of Oxford,

Many important questions ask for showing the existence of primes in `thin' sets  - those with $O(x^{1-\epsilon})$ elements less than $x$. The thinness of such sets presents several analytic difficulties.

 

The set of numbers with the digit 7 not appearing anywhere in their decimal expansion is a thin set, but has some unusually nice properties which circumvents some (but not all) of these analytic difficulties, and so is a nice test case. We show that there are infinitely many primes in this set. Our proof uses a mixture of bilinear sums, Fourier analysis, geometry of numbers and moment estimates related to a Markov process.

For more information, please contact Elena Mantovan by email at mathinfo@caltech.edu or visit http://math.caltech.edu/~numbertheory/.