BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The ternary Goldbach conjecture - Harald Helfgott (CNRS - Paris VI
 /VII)
DTSTART:20141119T140000Z
DTEND:20141119T150000Z
UID:TALK55835@talks.cam.ac.uk
CONTACT:HoD Secretary\, DPMMS
DESCRIPTION:\nThe ternary Goldbach conjecture (1742) asserts that every od
 d 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 conjec
 ture. In the years since then\, there has been a succession of results red
 ucing 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 t
 he 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.
LOCATION:CMS\, MR14
END:VEVENT
END:VCALENDAR