DATE2018-11-01 15:10-16:00


SPEAKER郭文堂 副教授(University of Waterloo

TITLE Prime Number Theorem and Dirichlet Series

ABSTRACT The Prime number theorem gives an asymptotic form for the prime counting function, which counts the number of primes less than some integer N. In 1792, when only 15 years old, Gauss proposed that the prime counting function is asymptotically equal to N/log N. Later, in 1896, Hadamard and de la Vallee Poussin independently gave proofs of this conjecture. In this talk, we will review the history of this problem and how it links to complex analysis.