The Complexity of Mathematics

EasyChair Preprint 3062, version 1

Abstract

The strong Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two primes. 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 principal 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 this happens, then the strong Goldbach's conjecture is true or this has an infinite number of counterexamples. In addition, if this happens, then the Twin prime conjecture is true. Moreover, if this happens, then the Beal's conjecture is true. Furthermore, if this happens, then the Riemann hypothesis is true. Since the weak Goldbach's conjecture was proven, then this will certainly happen.

Keyphrases: Conjecture, complexity classes, number theory, primes, reduction, regular languages

@booklet{EasyChair:3062,
  author    = {Frank Vega},
  title     = {The Complexity of Mathematics},
  howpublished = {EasyChair Preprint 3062},
  year      = {EasyChair, 2020}}