Event
Xiannan Li, KSU
Thursday, November 23, 2017 14:00to15:30
LB 921-4, Concordia University, CA
Primes in sparse polynomial sequences
One particularly difficult class of problems in prime number theory is to prove that certain polynomials take on infinitely many primes values. Typically, these problems become intractable when the sequence given by the polynomial is sparse. In this talk, I will describe some recent work that shows that there are infinitely many primes in a certain sparse sequence.