标题: Goldbach Theorem [打印本页] 作者: 数学1+1 时间: 2014-6-14 11:42 标题: Goldbach Theorem Goldbach Theorem7 J( L, U- `9 X8 W9 g X4 _
Union of set construction and analysis % l) X5 {# I- a0 B" H5 P" |# ?. x7 {! h, Z2 a7 J p0 {
Loudi Xiaoguang mathematical research studio Su Xiaoguang3 N3 h# F1 L8 ^0 j7 ]* N& }$ A: D
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; o7 U/ S9 u
So when N> 800000 when, D(N)No less than1.8432(1-1/logN)N/log^2_(N-2);I + P) U9 C; [7 y0 iNot more than5.0176[1+2/logN +o(1)]N/log[(N-2)/2]log(N-2)。 . |9 j& t- v/ ?0 h( o' LKey words: Germany，Goldbach，Union of set,even number, prime number, 6 h$ {8 z% W1 {# O( i, G
MR (2000) theme classification: 11 P32 $ H, z# z/ w" _7 KEmail: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:2 |. J( _/ v" _9 M3 S
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] ' D8 ~. M8 v5 i% Z! GFor N>800000,D(N) mean2 {" Q+ e# q' w# h
N=P_1+P_2 : m9 m8 d9 t/ C7 K' q5 \0 V9 gThe number of elements。prime number P_1,P_2>2。 ' V' ]7 ]$ M Y( U2 P5 e 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]" h1 \8 P! b1 v
+[log N(N-2)/4]/[2 (log N/2)(log N/2)] 5 `) M+ V- a. \) z +{2 [log(N-2)/2] [log(N-2)/2]log N(N-2)}/[log N log N log(N-2)log(N-2)]