Having foolishly ventured out to Monash Uni last Tuesday to see the Evil Mathologre give a Lunchmaths talk, I found myself roped in to giving the next one. So, anyone who is around Monash next Tuesday and has nothing better to do is welcome to attend. Details below, and here.
Not Quite the Prime Number Theorem
The Prime Number Theorem is one of the real gems, telling us in a very precise way the probability that a natural number is prime. The theorem is also hard work to prove. However, with just a few factorials and a little factoring we can sort of, kind of, almost* prove the Prime Number Theorem.
In this talk we’ll go through some easy, high schoolish arguments that give some surprisingly precise information about what the prime numbers are doing.
* Not really.