University of Cambridge > Talks.cam > Special DPMMS Colloquium > The ternary Goldbach conjecture

The ternary Goldbach conjecture

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

  • UserHarald Helfgott (CNRS - Paris VI/VII)
  • ClockWednesday 19 November 2014, 14:00-15:00
  • HouseCMS, MR14.

If you have a question about this talk, please contact HoD Secretary, DPMMS.

This talk has been canceled/deleted

The ternary Goldbach conjecture (1742) asserts that every odd number greater than 5 can be written as the sum of three prime numbers. Following the pioneering work of Hardy and Littlewood, Vinogradov proved (1937) that every odd number larger than a constant C satisfies the conjecture. In the years since then, there has been a succession of results reducing C, but only to levels much too high for a verification by computer up to C to be possible (C>10^1300). (Works by Ramare and Tao have solved the corresponding problems for six and five prime numbers instead of three.) My recent work proves the conjecture. We will go over the main ideas of the proof.

This talk is part of the Special DPMMS Colloquium series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

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