大偶数表为两个素数之和(下)

The Representation of Large Even Integer as a Sum of Two Primes

In the paper: the representation of large ev en integer as a sum of two primes is proved to be right independently by each of W-progression ∑(∞)(X n=1D)(n+1)(n-1)!of the discovery and the prime theorem. I t is induced as two following problems which are solved for getting results of ration: Is there a function of f(2n) to be only depend ent upon 2n or not? And it can express a number of group of prime solutions on r epresentatio n of even integer as a sum of two primes. In one－ dimensional space, the prime t heorem is led into odd sequence integer to find P(G)～2 log n is regarded as a data handling tool for setting a mathematical model of ran dom sampling, get:P2n(1，1)n＞2 2n-P 2=P 1=f(2n)～(2nlogn/2log2nlog2n(2n→∞). The prime theorem π(x) is gene ralized to the two-dimensional space: π(x,y). A mathematical model of average values is set up by π(x,y), get: P2n(1，1)2 (X n＞2 2n=P 1+P 2)=f(2n)2～(2n log22n SX) (2n→∞). But for expressing a number of group of prime solutions of even integer，the laws of values of principal steps of the two different functions f(2n) and f(2n) 2 are unanimous. Thus, the proof of different ways lead to the same result and determines a forceful declaration: Goldbach’s conjecture is proved to be a right theorem.