Goldbach Theorem

数学1+1

                                Goldbach Theorem
1 |! F$ G3 }2 r5 U8 e' V/ U                         Union of set construction and analysis
: o6 z: Q1 d! K$ _3 W1 l
/ G) u# n; m- ~, V2 G2 I; v5 `, i# Y　　　　　　　Loudi Xiaoguang mathematical research studio Su Xiaoguang
, Z( ]' h9 W1 Q# n2 h8 G: ]　　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)
So when N> 800000 when, D(N)No less than1.8432(1-1/logN)N/log^2_(N-2);I
, L0 |' W2 L) \: ?- \0 cNot more than5.0176[1+2/logN +o(1)]N/log[(N-2)/2]log(N-2)。
Key words: Germany，Goldbach，Union of set,even number, prime number,
4 j; {: R( ^% \2 z. k5 a  _MR (2000) theme classification: 11 P32
Email:suxiaoguong@foxmail. Com

MichaeLonger

英语不好。。。

MichaeLonger

看不明白啊。。

MichaeLonger

哎。。。。。

MichaeLonger

英语渣好成问题。。

数学1+1

Goldbach formula:
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]
: n, B6 q. n. ~8 f8 q5 N9 YFor N>800000,D(N) mean
" q) I( P/ t& K8 A0 `       N=P_1+P_2
The number of elements。prime number P_1,P_2>2。
      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]
4 f7 y9 I8 {5 Y' I/ K               +[log N(N-2)/4]/[2 (log N/2)(log N/2)]
               +{2 [log(N-2)/2] [log(N-2)/2]log N(N-2)}/[log N log N log(N-2)log(N-2)]