标题: Goldbach Theorem [打印本页] 作者: 数学1+1 时间: 2014-6-14 11:42 标题: Goldbach Theorem Goldbach Theorem2 `5 m+ r. I* O. G% a$ r
Union of set construction and analysis $ w) r5 P/ f) r3 O5 x y- z- C: s: n' b( d
Loudi Xiaoguang mathematical research studio Su Xiaoguang 9 \4 p" A7 g8 s; O6 j/ y Abstract: In the analytic number theory Goldbach problem is an important issue. The authors studied the：A={N │ N = (N-i) + i, N is a natural number, i belong to N} Clearly A is a countable set。C={N │ N = Pi + Pj, N is even number, Pi, Pj is prime number,i, j is natural number} Clearly, C is A subset。So C is a countable set.If x ={x|x no less than 6 and not more than N is an even number,x=P1+P2, P1, P2 is prime number},card (x)=M (x).Clearly, x is C subset。So x is a countable set.We can get the M(x) range,If N ={N|N = P1 + P2, N is even number, P1, P2 is prime number},card (N)=D(N)，D(N)=M(N)-M(N-2)6 V- b) _9 R0 b& A
So when N> 800000 when, D(N)No less than1.8432(1-1/logN)N/log^2_(N-2);I) R' j+ r$ v/ @8 @
Not more than5.0176[1+2/logN +o(1)]N/log[(N-2)/2]log(N-2)。9 A7 ?* H/ H1 I' ~0 C4 _
Key words: Germany，Goldbach，Union of set,even number, prime number, ) I# A$ [2 Q: S' i* y9 v
MR (2000) theme classification: 11 P32 : i" \- K- Y& R9 w- u
Email:suxiaoguong@foxmail. Com作者: MichaeLonger 时间: 2014-6-17 12:44
英语不好。。。作者: MichaeLonger 时间: 2014-6-17 12:44
看不明白啊。。作者: MichaeLonger 时间: 2014-6-17 12:45
哎。。。。。作者: MichaeLonger 时间: 2014-6-17 12:45
英语渣好成问题。。作者: 数学1+1 时间: 2014-7-16 09:30
Goldbach formula: ' ^4 y* j/ s4 E: H% g6 G 1.8432(1-1/log N)N/log(N-2)log(n-2)<D(N)<2.5088 S(N)N/[log(N-2)/2][log(N-2)/2] 5 k: o4 v* \. OFor N>800000,D(N) mean9 S3 `( A% P- s# n; y
N=P_1+P_2; O* @' B& c- f1 q7 P9 f5 v
The number of elements。prime number P_1,P_2>2。 0 F9 y$ e, B; u% H1 {! q S(N)=1-(2 log 2 log 2)/[log(N-2)log(N-2)]-2{[ log(N-2)/2]log N(N-2)}/[2 log N log(N-2)log N/2] 0 D4 B% }: x7 y- b* j6 y3 F/ e +[log N(N-2)/4]/[2 (log N/2)(log N/2)] 6 ^6 l6 J3 Z! o- F# T +{2 [log(N-2)/2] [log(N-2)/2]log N(N-2)}/[log N log N log(N-2)log(N-2)]