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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Computational aspects of the proof of Goldbach's Ternary Conjecture

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Meeting the Challenge of Healthy Ageing in the 21st Century Cosmology, Astrophysics and General Relativity Pragmatics reading group Economic orthodoxy and barriers to the low-carbon economy Scott Polar Research Institute - HCEP (Histories, Cultures, Environments and Politics) Research Seminars

Other talks

Liver Regeneration in the Damaged Liver How to make good scientific figures Stakeholder perceptions across scales of governance: areas of controversy and consensus related to the Indonesian peatland fires Interrogating T cell signalling and effector function in hypoxic environments Acceleration of tropical cyclogenesis by self-aggregation feedbacks The Design of Resilient Engineering Infrastructure Systems with Bayesian Networks Active bacterial suspensions: from individual effort to team work The ‘Easy’ and ‘Hard’ Problems of Consciousness Computing knot Floer homology XZ: X-ray spectroscopic redshifts of obscured AGN Unbiased Estimation of the Eigenvalues of Large Implicit Matrices Group covariance functions for Gaussian process metamodels with categorical inputs
 

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