Lecture 1

Question 1

What is Dirichlet’s theorem

Answer 1

If k > 0 and gcd(h, k) = 1, then there are infinitely many primes in the arithemetic progression nk + h for n = 1, 2, . . ..

Question 2

What is the Prime number theorem

Answer 2

For large x, the ratio pi(x)/(x/log(x) approaches 1