| 大偶数表为两个素数之和（下） |
| |
| 引用本文： | 吴新生.大偶数表为两个素数之和（下）[J].安徽广播电视大学学报,2001(1):67-77. |
| |
| 作者姓名： | 吴新生 |
| |
| 作者单位： | 信息产业部电子第十六研究所，安徽合肥 230061 |
| |
| 摘 要： | In the paper: the representation of large even integer as a sum of two primes is proved to be right independently by each of W-progression ∑∞n=1(1)/((n+1)(n-1)!)of the discovery and the prime theorem. It is induced as two following problems which are solved for getting results of ration: Is there a function of f(2n) to be only dependent upon 2n or not? And it can express a number of group of prime solutions on representation of even integer as a sum of two primes. In one－dimensional space, the prime theorem is led into odd sequence integer to find P(G)～(2 )/(log n).P(G) is regarded as a data handling tool for setting a mathematical model of random sampling, get: P2n(1，1)n＞22n-P2=P1=f(2n)～(2nlogn/2)/(log2nlog2n)(2n→∞). The prime theorem π(x) is generalized to the two-dimensional space: π(x,y). A mathematical model of average values is set up by π(x,y), get: P2n(1，1)2n＞22n=P1+P2=f(2n)2～(2n)/(log22n)(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.
|
| 关 键 词： | 大偶数表 素数 Goldbach猜想 定理证明 增长因子 |
The Representation of Large Even Integer as a Sum of Two Primes |
| |
| WU Xin-sheng.The Representation of Large Even Integer as a Sum of Two Primes[J].Journal of Anhui Television University,2001(1):67-77. |
| |
| Authors: | WU Xin-sheng |
| |
| Abstract: | In the paper: the representation of large even integer as a sum of two primes is proved to be right independently by each of W-progression ∑∞n=1(1)/((n+1)(n-1)!)of the discovery and the prime theorem. It is induced as two following problems which are solved for getting results of ration: Is there a function of f(2n) to be only dependent upon 2n or not? And it can express a number of group of prime solutions on representation of even integer as a sum of two primes. In one－dimensional space, the prime theorem is led into odd sequence integer to find P(G)～(2 )/(log n).P(G) is regarded as a data handling tool for setting a mathematical model of random sampling, get: P2n(1，1)n＞22n-P2=P1=f(2n)～(2nlogn/2)/(log2nlog2n)(2n→∞). The prime theorem π(x) is generalized to the two-dimensional space: π(x,y). A mathematical model of average values is set up by π(x,y), get: P2n(1，1)2n＞22n=P1+P2=f(2n)2～(2n)/(log22n)(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. |
| |
| Keywords: | W-progression prime theorem second prime probability prime solution of even integer Goldbach line probability number theory |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
