MATH41022/MATH31022 - 2010/2011
To show how the tools of Mathematical analysis can be used to prove results about prime numbers and functions defined on the integers.
Brief Course Description
We start by giving two proofs of the infinitude of primes. The methods are elementary but poor in that they do not tell us the truth of how many primes there are. Stronger tools are introduced, improving the results until we can give a proof of the Prime Number Theorem.
On completion of this unit students
- will be able to utilise the correspondence between the product of Dirichlet series and composition of arithmetic functions,
- will be able to use the methods of Partial Summation and replacing sums by integrals,
- be able to prove elementary results on sums over primes,
- be able to prove some analytic properties of the Riemann zeta function,
- appreciate a proof of the Prime Number Theorem,
- will be able to use the Composition Method to estimate sums of arithemtic functions.
- Two proofs of the infinitude of primes. 
- Arithmetic functions and Dirichlet Series. 
- Elementary Prime Number Theory. 
- The Prime Number Theorem. 
- Sums of arithmetic functions. 
- T. Apostol, Introduction to Analytic Number Theory, 1st edition. 1976, Corrected 5th edition 2010, Springer, 1441928057
- G.J.O. Jameson, The Prime Number Theorem, LMS Student Texts 53, CUP 2003, 0-521-89110-8.
Teaching and learning methods
Two lectures each week, three from week 4 onwards and a weekly examples class. In addition students should expect to do at least seven hours private study each week for this course unit.
- End of semester examination: three hours weighting 100% (MATH41002)