COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
The ternary Goldbach conjectureAdd to your list(s) Download to your calendar using vCal
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. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsThe LMS Hardy Lecture PMRFPS's French Graduate Research Seminar (FGRS) SPI SCI Cambridge Science Talks Martin Centre Research Seminars, Dept of ArchitectureOther talksMaking Refuge: Cambridge & the Refugee Crisis Understanding Ellipsis: Corpus, Annotation, Theory Access to Medicines A tale of sleepless flies and ninna nanna. How Drosophila changes what we know about sleep. Barnum, Bache and Poe: the forging of science in the Antebellum US What is the History of the Book? |