标题: Goldbach Theorem [打印本页] 作者: 数学1+1 时间: 2014-6-14 11:42 标题: Goldbach Theorem Goldbach Theorem. O' H8 {7 V, j3 i# e' P
Union of set construction and analysis % u1 m: k1 K3 ?" ]& {3 R$ {5 k k; d2 } \5 h
Loudi Xiaoguang mathematical research studio Su Xiaoguang1 P( @- \3 K# T! p2 G0 h! O5 z
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) . W. R- \$ L+ s) ySo when N> 800000 when, D(N)No less than1.8432(1-1/logN)N/log^2_(N-2);I$ S6 Z9 z$ C/ X, F
Not more than5.0176[1+2/logN +o(1)]N/log[(N-2)/2]log(N-2)。 ! l( y- T$ A( bKey words: Germany，Goldbach，Union of set,even number, prime number, & X& z; _* _) H' T
MR (2000) theme classification: 11 P32 i0 w9 T! n0 s! Y9 q' q& BEmail: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: 7 B: G) b% S8 B$ m$ y& K 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]" [6 l0 S, E5 J: I# i/ z
For N>800000,D(N) mean % |9 s6 s/ s. L% S2 a# I5 U N=P_1+P_2 , z; h( A$ n' F( Y9 {; b* m' `9 xThe number of elements。prime number P_1,P_2>2。1 d* i' p1 }5 y* i! m
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]( h# I5 G4 }& r; o3 t2 b$ f
+[log N(N-2)/4]/[2 (log N/2)(log N/2)] 0 n/ P% O y& Z" J7 O- U0 Z6 U +{2 [log(N-2)/2] [log(N-2)/2]log N(N-2)}/[log N log N log(N-2)log(N-2)]