Planned intervention: On Thursday March 28th 07:00 UTC Zenodo will be unavailable for up to 5 minutes to perform a database upgrade.

There is a newer version of the record available.

Published February 13, 2020 | Version v14
Preprint Open

The Complexity of Goldbach's Conjecture

Creators

  • 1. Joysonic

Description

The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. This is known as the strong Goldbach's conjecture. The conjecture that all odd numbers greater than 7 are the sum of three odd primes is known today as the weak Goldbach conjecture. A major complexity class is NSPACE(S(n)) for some S(n). We show if the weak Goldbach's conjecture is true, then the problem PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n). However, if PRIMES is not in NSPACE(S(n)) for all S(n) = o(log n), then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. Since Harald Helfgott proved that the weak Goldbach's conjecture is true, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples, where the case of infinite number of counterexamples statistically seems to be unlikely.

Files

manuscript.pdf

Files (298.6 kB)

Name Size Download all
md5:c55397ab3290bbf551665f671681aca7
298.6 kB Preview Download