Computational aspects of the proof of Goldbach's Ternary Conjecture
Add to your list(s)
Download to your calendar using vCal
 David Platt (Bristol)
 Tuesday 15 October 2013, 16:1517:15
 MR13.
If you have a question about this talk, please contact James Newton.
Goldbach’s Ternary (or Weak) Conjecture states that all odd numbers greater than five can be expressed as the sum of three primes and dates from 1742. Helfgott’s recent proof relied in part on substantial (but finite!) computer verification both of the conjecture itself and of the Generalised Riemann Hypothesis. We will describe both computations emphasising to what extent they can be regarded as rigorous.
This talk is part of the Number Theory Seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
