Numerical verification of the Goldbach conjecture

ABSTRACT:   The Strong Goldbach conjecture, GC, dates back to $1742$. It states that every even integer greater than four can be written as the sum of two prime numbers. Since then, no one has been able to prove the conjecture. The conjecture has been verified to be true for all even integers up to ${4.10}^{18}$. In this article, we prove that the conjecture is true for all integers, with at least three different ways. In short, this treaty has as objective show the proof of GC, and presents a new resolution to the conjecture. Knowing that, these infinities establish other groups of infinities, in a logical way the conviction for the method and idea of proving it, we stand and separate these groups to prove, not only a sequence, but the whole embodiment of arithmetic properties called here as groups, as well as its infinity conjectured for centuries.

Keywords: Goldbach’s Conjecture; Crystallographic group; Cobordism group; Algebraic number theory; Multiprime Theorem’s; Productoria Table.

AMS Subject Classification: 11N05; 11A41; 11A25; 11Y11; 11P32; 05A10; 11N56; 11D99; 11P99; 11N32; 05A17.

Title	Numerical verification of the Goldbach conjecture
Canonical name	NumericalVerificationOfTheGoldbachConjecture
Date of creation	2014-10-25 22:17:31
Last modified on	2014-10-25 22:17:31
Owner	Paulo Fernandesky (1000738)
Last modified by	unlord (1)
Numerical id	5
Author	Paulo Fernandesky (1)
Entry type	Conjecture
Classification	msc 11N05
Classification	msc 11A41
Classification	msc 11A25
Classification	msc 11Y11
Classification	msc 11P32
Classification	msc 05A10
Classification	msc 11N56
Classification	msc 11D99
Classification	msc 11P99
Classification	msc 11N32
Classification	msc 05A17