University of Cambridge > Talks.cam > Number Theory Seminar > Computational aspects of the proof of Goldbach's Ternary Conjecture

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Computational aspects of the proof of Goldbach's Ternary Conjecture

Download to your calendar using vCal

  • UserDavid Platt (Bristol)
  • ClockTuesday 15 October 2013, 16:15-17:15
  • HouseMR13.

If you have a question about this talk, please contact James Newton .

Goldbach’s Ternary (or Weak) Conjecture states that all odd numbers greater than five can be expressed as the sum of three primes and dates from 1742. Helfgott’s recent proof relied in part on substantial (but finite!) computer verification both of the conjecture itself and of the Generalised Riemann Hypothesis. We will describe both computations emphasising to what extent they can be regarded as rigorous.

This talk is part of the Number Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Department of Pharmacology Seminar Series Delivered online via Google Meet Exoplanet Seminars

Other talks

Psychiatry and Pain Medicine What’s my reproduction number? Life history strategies: an interdisciplinary perspective Am I a Member? Auditing Private Machine Learning Title TBC Title TBC Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity