The Discovery of Goldbach Conjecture Code and Proof of Goldbach Conjecture
by
QingHui Chen
Goldbach conjecture research, 4350 Doncaster Dr. Madison, WI53711, USA

It has been discovered in my research that there is indeed a hidden and unknown real number (called Goldbach conjecture code) in the matching situation of Goldbach conjecture. The discovery of Goldbach conjecture code makes the irregular order in the conjecture be able to be transformed into very regular, so that it can be revealed the law of Goldbach conjecture, or the regulation of distributions of Goldbach conjecture probabilities, exist. It is based on the law, a exactly quantitative equation, that the proof of Goldbach conjecture could be really and completely proved by the probability method and basically mathematical principles. The proved exact mathematical expression of Goldbach conjecture theorem is : M1=A1A2/(N/2-d)>or=[A1A2/(N/2)]>or=1, or M1>or=1/ln(N/2)*[(N/lnN)-(N/2)/ln(N/2)]>or=1 (N>or=30), in which, M1 means the number of how many ways to write any even number greater than 2 as a sum of two primes, N is any even number greater than 2 (or N>or=30) , A1 is the number of primes which are lesser than or equal to (1/ 2 )N, A2 is the number of primes which are greater than or equal to (1/ 2)N but lesser than or equal to (N - 1), and d is Goldbach conjecture code ( -N/2<d<N/2) and a real number. The proof of Goldbach conjecture reveals that one of the features of prime distribution regulation is the partial symmetric distribution which is related to even number and infinite with even number’s infinite big.

PDF

Date received: January 22, 2007