Harald Helfgott: Towards ternary Goldbach's conjecture

- Chapter markers and keywords to watch the parts of your choice in the video
- Videos enriched with abstracts, bibliographies, Mathematics Subject Classification
- Multi-criteria search by author, title, tags, mathematical area

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 [is greater than] 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.

Recording during the thematic meeting: "Analytic number theory" the June 18, 2013 at the Centre International de Rencontres Mathématiques (Marseille, France)

Filmmaker: Guillaume Hennenfent

[dr.ssrinivasrau]

Wonderful exposition of a great achievement.I recommend also Zhang's ICM 2014 talk on the Twin Prime breakthrough.