BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Special DPMMS Colloquium
SUMMARY:The ternary Goldbach conjecture - Harald Helfgott
(CNRS - Paris VI/VII)
DTSTART;TZID=Europe/London:20141119T140000
DTEND;TZID=Europe/London:20141119T150000
UID:TALK55835AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/55835
DESCRIPTION:\nThe ternary Goldbach conjecture (1742) asserts t
hat every odd number greater than 5 can be written
as the sum of three prime numbers. Following the
pioneering work of Hardy and Littlewood\, Vinograd
ov proved (1937) that every odd number larger than
a constant C satisfies the conjecture. In the yea
rs since then\, there has been a succession of res
ults reducing C\, but only to levels much too high
for a verification by computer up to C to be poss
ible (C>10^1300). (Works by Ramare and Tao have so
lved the corresponding problems for six and five p
rime numbers instead of three.) My recent work pro
ves the conjecture. We will go over the main ideas
of the proof.
LOCATION:CMS\, MR14
CONTACT:HoD Secretary\, DPMMS
END:VEVENT
END:VCALENDAR