UNIVERSITY OF WAIKATO
Department of Mathematics
MATH509-16A Number Theory 2016
A two hour bookwork test will be on Monday 20th June at 2pm in G3.20 (off G3.19). Assignments to be marked should be handed in by Friday 10th June 5pm.
web site: math.waikato.ac.nz/~kab/math509-16A.html
For some time now there has been developing within and outside of mathematics a renewed energy and interest in matters relating to number theory. This has come from not only the recent solution to some unsolved long outstanding problems using modern methods, like Wilesí proof of Fermats Last Theorem, but also because of the pressing need for effective encryption in commercial, strategic and personal computer based communications. In addition, the use of the computer has made it possible to explore a much wider domain of number based phenomena than before, leading to new ideas. However, quite a few classical problems relating to the fundamental structure of natural numbers, are still unsolved. Since these numbers underpin all of mathematics and its applications, there is a lot of challenge and life in this subject.
During even the past three years there have been remarkable advances in prime number theory. The first was the existence of arithmetic progressions consisting only of primes of any given prescribed finite length - proved by Terry Tao and Ben Green. Then the existence of an infinite set of pairs of successive primes at distance less than or equal to 246, by Zhang and a host of others including Maynard. Finally by Harald Helfgott, the final solution to Goldbach's weak problem - every odd integer can be expressed as the sum of three primes.
Natural numbers exhibit a high degree of randomness when it comes to their prime factors. For example successive natural numbers have no primes in common! It is the method of analytic number theory to discover properties of infinite subsets of these numbers which have properties we can easily understand and compare. For example that the number of primes is infinite or that the number of primes up to x is like x/log x. Another is that there is always a prime between n and 2n.
The following is a list of the type of topics which might be included, but it is not exhaustive and all topics listed would not necessarily be covered:
- Summation flormulae, Euler and Abel summation and inequalities, Stirling's formula
- Bounds for the number of primes up to x.
- The Riemann zeta function, zeta zeros, the Riemann hypothesis
- The proof of the prime number theorem
- Dirichlet characters
- The proof of Dirichlet's theorem on primes in arithmetic progressions
- The global and local behaviour of arithmetic functions, average order and normal order
- If time permits, smooth numbers and their applications
- A summary of recent results on primes in arithmetic progressions, gaps between primes, and Goldbach's conjecture.
Kevin Broughan, 3rd June 2016.