## Lethbridge Number Theory and Combinatorics Seminar: Habiba Kadiri

- Date: 02/13/2017
- Time: 12:00

University of Lethbridge

Explicit results in prime number theory

The prime number theorem, proven in 1896, is one of the first major theorems in analytic number theory. It provides estimates for prime counting functions. In 1962, Rosser and Schoenfeld gave a method to estimate the error term in the approximation of the prime counting function ψ(x). Since then, progress on the numerical verification of the Riemann Hypothesis and widening the zero-free region of the Riemann zeta function have allowed numerical improvements of these bounds. In this talk, we present various new explicit methods such as introducing some smooth weights and establishing some zero density estimates for the Riemann zeta function. We also present some explicit results for primes in short intervals and for primes in arithmetic progressions.

Location: B660 University Hall

Web page: http://www.cs.uleth.ca/~nathanng/ntcoseminar/