Computers and the proof of Goldbach's weak conjecture Seminar

Last year, Helfgott published a proof of Goldbach's weak conjecture, i.e. that every odd number greater than 5 can be expressed as the sum of three primes. This relied in part on two substantial computations. I will outline the role played by these computations in that proof and how they were undertaken.