University of Cambridge > Talks.cam > Number Theory Seminar > Computational aspects of the proof of Goldbach's Ternary Conjecture

Computational aspects of the proof of Goldbach's Ternary Conjecture

Add to your list(s) Download to your calendar using vCal

  • UserDavid Platt (Bristol)
  • ClockTuesday 15 October 2013, 16:15-17:15
  • HouseMR13.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity