Tuesday, September 02, 2014,
15:40, IUM, conference hall
The ternary Goldbach conjecture
Harald Helfgott (Paris)
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 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 a joint session of the Globus seminar and the conference "Zeta Functions 5".
| 28.11.2014 | Leonid Petrov |