Goldbach’s problem

数学1+1

Goldbach’s problem                    Su XiaoguangAbstract: In the analytic number theory Goldbach problem is an important issue. The authors studied the：[code]<SPAN style="FONT-FAMILY: Arial; COLOR: #333333; FONT-SIZE: 12pt; mso-font-kerning: 0pt; mso-ansi-language: EN" lang=EN></SPAN>[/code]A= \bigcup_{i=0}^{\infty }A_{i},A_{i}=\left \{ i+0,i+1,i+2,\cdots \right \}\Rightarrow B(x,N)=\sum_{N\leqslant x,B(N)\neq 0}1,B(N)=\sum_{n+m=N,0\leq n,m\leq N}1.C=\bigcup_{i=0}^{\infty }C_{i},C_{i}=\left \{ p_{i}+p_{0},p_{i}+p_{1},p_{i} +p_{i},\cdots \right \}\wedge N> 800000\Rightarrow M(x)=\sum_{N\leq x,D(N)\neq 0}1DeducedD(N)=\sum_{p_{1}+p_{2}=N,p_{1},p_{2}\geq 3}1\wedge 1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}\leq D(N)\leq 5.0176\left [ 1+log\frac{2}{N}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}
3 \: s2 s1 `+ t2 x; j9 x Key words: Germany，Goldbach，even number, Odd number ，prime number, MR (2000) theme classification: 11 P32 Email:suxiaoguong@foxmail. com

数学1+1

                  Goldbach’s problem (pdf)

                       Su Xiaoguang
     

Abstract: In the analytic number theory Goldbach problem is an important issue. The authors studied the：

A= \bigcup_{i=0}^{\infty }A_{i},A_{i}=\left \{ i+0,i+1,i+2,\cdots \right \}\Rightarrow B(x,N)=\sum_{N\leqslant x,B(N)\neq 0}1,B(N)=\sum_{n+m=N,0\leq n,m\leq N}1.

C=\bigcup_{i=0}^{\infty }C_{i},C_{i}=\left \{ p_{i}+p_{0},p_{i}+p_{1},p_{i} +p_{i},\cdots \right \}\wedge N> 800000\Rightarrow M(x)=\sum_{N\leq x,D(N)\neq 0}1

Deduced

D(N)=\sum_{p_{1}+p_{2}=N,p_{1},p_{2}\geq 3}1\wedge

1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}\leq D(N)\leq 5.0176\left [ 1+log\frac{2}{N}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}

Key words: Germany，Goldbach，even number, Odd number ，prime number,

MR (2000) theme classification: 11 P32

Email:suxiaoguong@foxmail. com

数学1+1

                  Goldbach’s problem
! L# J3 u; W7 F                    Su Xiaoguang
Abstract: In the analytic number theory Goldbach problem is an important issue. The authors studied the：
& p: ^' F3 s6 b5 y$ F, n) i
A= \bigcup_{i=0}^{\infty }A_{i},A_{i}=\left \{ i+0,i+1,i+2,\cdots \right \}\Rightarrow B(x,N)=\sum_{N\leqslant x,B(N)\neq 0}1,B(N)=\sum_{n+m=N,0\leq n,m\leq N}1.
* n8 `8 e* n% R: x4 c$ @C=\bigcup_{i=0}^{\infty }C_{i},C_{i}=\left \{ p_{i}+p_{0},p_{i}+p_{1},p_{i} +p_{i},\cdots \right \}\wedge N> 800000\Rightarrow M(x)=\sum_{N\leq x,D(N)\neq 0}1
Deduced
D(N)=\sum_{p_{1}+p_{2}=N,p_{1},p_{2}\geq 3}1\wedge
2 w2 G; x! H: R3 n+ Q1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}\leq D(N)\leq 5.0176\left [ 1+log\frac{2}{N}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}

6 j( x' c# c  g' sKey words: Germany，Goldbach，even number, Odd number ，prime number,
MR (2000) theme classification: 11 P32
Email:suxiaoguong@foxmail. com
0 ?3 b! R$ E9 [7 l2 }§ 1 Introduction
) S  y# {) ^4 v, V6 \) s          In 1742, the German mathematician Christian Goldbach (1690-1764)， Put forward two speculated about the relationship between positive integers and prime number，using analytical language expressed as:
/ q% j+ z) N0 h- p3 _（A）For even number N
' m" k; S- ~% F4 {0 ~
N\geq 6\Rightarrow D(N)=\sum_{p_{1}+p_{2}=N,p_{1},p_{2}Is a prime number}1>0
% L8 n8 C/ ~/ \& ?( m+ Z+ e9 z
(B)  For odd number N
: j' s3 O6 h9 c
N\geq 9\Rightarrow T(N)=\sum_{p_{1}+p_{2}+p_{3}=N.p_{1},p_{2},p_{3}\geq 3}1>0

This is the famous GOldbach conjecture。If the proposition (A) true, then the proposition (B) True。So, as long as we prove Proposition (A), Launched immediately conjecture (B) is correct
         
§2 Correlation set constructor
A_{0}=\left \{ 0+0,0+1,0+2,\cdots  \right \}
8 t) C$ e5 @  ?! N+ j7 p A_{1}=\left \{ 1+0,1+1,1+2,\cdots  \right \}
A_{2}=\left \{ 2+0,2+1,2+2,\cdots  \right \}
\cdots
; B/ a" i& I& CA=\bigcup_{i=0}^{\infty }A_{i}\Rightarrow B(N)=\sum_{n_{1}+n_{2}=N.0\leq n _{1},n_{2}\leq N}1,B(x,N)=\sum_{N\leq x,B(N)\neq 0}1      （1）
4 p* g9 K; N* sp_{0}=2,p_{1}=3,p_{2}=5,\cdots C_{0}=\left \{ p_{0} +p_{0},p_{0}+p_{1},p_{0}+p_{2},\cdots \right \} C_{1}=\left \{ p_{1} +p_{0},p_{1}+p_{1},p_{1}+p_{2},\cdots \right \} C_{2}=\left \{ p_{2} +p_{0},p_{2}+p_{1},p_{2}+p_{2},\cdots \right \} C=\bigcup_{i=0}^{\infty }C_{i}\Rightarrow D(N)=\sum_{p_{1}+p_{2}=N.p_{1},p_{2}\geq 3}1\wedge M(x)=\sum_{N\leq x,D(N)\neq 0}  （2）      
  §3    Ready  Theorem
. R! p4 Q* K9 TTheorem 1
M_{i}=(x_{1}^{(i)},x_{2}^{(i)},\cdots ,x_{i}^{(i)},\cdots ),Is a countable set\Rightarrow M=\bigcup_{i=1}^{N}M_{i},Is a countable set
  .Proof: Suppose M_{1},M_{2},\cdots ,M_{N},Is a countable set, M=\bigcup_{i=1}^{N}M_{i}
) {; r1 i2 W& Z2 r, I% n$ j\because M_{1}:x_{1}^{(1)},x_{2}^{(1)},x_{3}^{(1)},\cdots ,x_{i}^{(1)},\cdots
' I1 G( N' ]; n8 A  m( m7 tM_{2}:x_{1}^{(2)},x_{2}^{(2)},x_{3}^{(2)},\cdots ,x_{i}^{(2)},\cdots
M_{N}:x_{1}^{(N)},x_{2}^{(N)},x_{3}^{(N)},\cdots ,x_{i}^{(N)},\cdots
\cdots
5 d9 ?7 K* d: J\therefore M:x_{1}^{(1)},x_{1}^{(2)},\cdots ,x_{1}^{(N)},x_{2}^{(1)},x_{2}^{(2)},\cdots ,x_{2}^{(N)},\cdots Countable
1 a$ n) q( n1 l     Theorem 2 (Prime number theorem)
, l& V7 q0 }/ Z7 I- R. r) N9 S3 U
  c4 J7 r6 m* ]; J, Y7 Z\pi (x)\sim \frac{x}{logx}^{\left [ 1 \right ]}
; R; A" e% n. l: H+ ~     Theorem 3  For even number x
( z, m: ]3 z; O$ _6 y( h( k2 j- Jx>800000\wedge M_{1}=minM(x)\Rightarrow M_{1}(x)=\frac{1}{2}\pi (x)\left [ \pi (x) -1\right ]
, H' k! p3 [. U+ {" }2 m0 uProof: According to Theorem 1, (1)  
  \because A_{i},A_{j} Countable,
\therefore A Countable\wedge B(x,N)=\frac{1}{2}(N+1)(N+2)
Similarly, according to Theorem 1, (2), C countable
Suppose
( B2 p) O0 C. f      M_{1}(x)=minM(x)
6 ~! y. n+ A$ ]$ Oaccording to （2）, Then we have
" _* J+ Q( s# z# I2 z  P/ @. M_{1}(x)=\frac{1}{2}\pi (x)\left [ \pi (x)-1 \right ]
/ y( a- I6 s8 P6 D3 l, j, D8 u& M Theorem 4  For even number x
x>800000\wedge M_{2}(x)=maxM(x)\Rightarrow M_{2}(x)=4\pi (\frac{x}{2})\pi (x)-2\pi ^ {2}(\frac{x}{2})-3\pi (\frac{x}{2})-\pi ^{2}(x)+\pi (x)                        （3）
. ?8 B$ F9 U3 x# Y  c( _Proof: According to (2)，Then we have
/ m, m5 W* ^2 PM(x)=\sum_{N\leq x,D(N)\neq 0}1< \sum_{3\leq p_{1},p_{2}\leq \frac{x}{2}}1+\sum_{3\leq p_{1}\leq \frac{x}{2},\frac{x}{2}< p_{2}< x}+\sum_{\frac{x}{2}<p _{1}< x,3\leq p_{2}\leq \frac{x}{2}}
) P! C$ W; h1 j" l: W% r2 l# r- w8 ?     Suppose
' W' R  c5 p. ~3 E3 w5 R" Q      M_{2}(x)=maxM(x)
\therefore M_{2}(x)
=\frac{1}{2}\cdot 2\pi (x)\left [ 2\pi (\frac{x}{2})-1 \right ]-\frac{1}{2}\left [ 2\pi (\frac{x}{2})-\pi (x) \right ]\left [ 2\pi (\frac{x}{2})-\pi (x) +1\right ]\cdot 2
=4\pi (x)\pi (\frac{x}{2})-2\pi ^{2}(\frac{x}{2})-3\pi (\frac{x}{2})-\pi ^{2}(x)+\pi (x)
) L" }* I. X& m1 ]3 ^§4 Goldbach's problem end
0 k/ ?, v5 D2 _Theorem 5  For evem number N
8 o& |' D6 R& i6 XN> 800000\Rightarrow D(N)\geq 1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}
     Proof: According to Theorem 2
9 p5 j3 k  c8 P5 e. J1 wN> 800000\Rightarrow \alpha \frac{N}{logN}\leq \pi (N)\leq \beta \frac{N}{logN}      (4)
/ s% u) x; `- j9 VLet   c_{1}=min(\alpha ,\beta ),
: a/ }4 n8 M6 o0 |According to Theorem 3,Then we have
* ]7 i  w6 V7 ^* _4 |! L2 jD_{1}(N)=M_{1}(N)-M_{1}(N-2)
Clear
D(N)\geq D_{1}(N)
\because log(1+x)=\int_{0}^{x}\frac{dt}{1+t}=x-\int_{0}^{x}\frac{t}{1+t}dt
6 K! i; P$ S1 @\because x\geq-\frac{1}{2} \Rightarrow log(1+x)=x+o(x^{2})           (5)
\therefore D_{1}(N)=2c_{1}^{2}(1-\frac{1}{logN})\frac{N}{log^{2}(n-2)}+o(1)
/ K4 Q0 J8 H1 K9 qN\rightarrow \infty ,o(1)\rightarrow 0\Rightarrow
D(N)\geq 1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}
Theorem 6  For evem number N
; J5 x, O  w. ]* A) j* K% [N> 800000\Rightarrow D(N)\leq
) ?0 P( I# t. o( M" F9 B5.0176\left [ 1+\frac{2}{logN}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}
. P, o  E! ?8 l$ @. y& p8 BProof : According to (4)
% q3 B! L: [* i( Y" [3 j; X/ U* iLet  c_{2}=max(\alpha ,\beta )
According to Theorem 4,Then we have
: U+ y+ R% x( t' r, v. eD_{2}(N)=M_{2}(N)-M_{2}(N-2)
5 t5 N3 p. N% r6 ~\because D(N)\leq D_{2}(N)
. W$ T% E9 @) b' sAccording to (5), Then we have
D(N)\leq
: d8 t' F+ Q. B- {9 s3 f) h% |5.0176\left [ 1+\frac{2}{logN}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}
+ E1 q+ ~0 V" U5 B8 s0 sTheorem 7 (Goldbach Theorem)  
For evem number N
N\geq 6\Rightarrow D(N)= \sum_{p_{1}+p_{2}=N,p_{1},p_{2}\geq 3}1\geq 1
! O! p) [5 h0 j1 A4 k5 I9 JProof : According to Shen Mok Kong verification
* V* c/ ?* ]$ G: w6\leq N\leq 3.3\times 1000000^{\left [ 3 \right ]}\Rightarrow D(N)\geq 1
2 x1 x2 J# j, c0 AAccording to Theorem 5, Theorem 6, Then we have
# H4 p, ^; [8 ~  @6 wN> 800000\Rightarrow 1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}\leq D(N)\leq 5.0176\left [ 1+\frac{2}{logN}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}
\therefore N\geq 6\Rightarrow D(N)\geq 1
% C6 U, z9 g9 d, [- a5 G4 U6 |Lemma 1 For odd number N
6 K$ s- p! y$ i$ v+ a, W- D/ a1 ]5 `N\geq 9\Rightarrow
5 P, g: `0 V7 y0 X) }6 iT(N)=\sum_{p_{1}+p_{2}+p_{3}=N,p_{1},p_{2},p_{3}\geq 3}1\geq 1
$ [4 B7 {  l; D5 Y) `* }Proof et  n\geq 4
\because 2n+1=2(n-1)+3
According to Theorem 7,  Then we have
N\geq 9\Rightarrow T(N)\geq 1


% C" _$ Z6 Y) C* `% H" ]/ [' p    References
[1]  Wang yuan,TANTAN SUSHU,Shanghai, Shanghai Education Publishing House(1983),42.
[2]  U﹒Dudley,Elementary number theory, Shanghai, Shanghai Science and Technology Press,(1980),195.
[3] Pan Chengdong,Pan Chengbiao,Goldbach conjecture,Beijing,Science Publishing house,(1984),1.

" ~/ {, c6 _  t2 j- F) B

数学1+1

阅读本帖需具备阅读LATEX文件的知识，作者有一word文件上传，有兴趣的读者可下载阅读。

数学1+1

                  Goldbach’s problem

                    Su Xiaoguang

摘要：哥德巴赫问题是解析数论的一个重要问题。作者研究了

A= \bigcup_{i=0}^{\infty }A_{i},A_{i}=\left \{ i+0,i+1,i+2,\cdots \right \}\Rightarrow B(x,N)=\sum_{N\leqslant x,B(N)\neq 0}1,B(N)=\sum_{n+m=N,0\leq n,m\leq N}1.

C=\bigcup_{i=0}^{\infty }C_{i},C_{i}=\left \{ p_{i}+p_{0},p_{i}+p_{1},p_{i} +p_{i},\cdots \right \}\wedge N> 800000\Rightarrow M(x)=\sum_{N\leq x,D(N)\neq 0}1

Deduced

D(N)=\sum_{p_{1}+p_{2}=N,p_{1},p_{2}\geq 3}1\wedge

1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}\leq D(N)\leq 5.0176\left [ 1+log\frac{2}{N}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}

Key words: Germany，Goldbach，even number, Odd number ，prime number,

MR (2000) theme classification: 11 P32

Email:suxiaoguong@foxmail. com

§ 1  引言
1 j7 T) O& ]3 {+ }0 b8 @# f$ L3 [      1742年，德国数学家Christian Goldbach提出了关于正整数和素数之间关系的两个推测，用分析的语言表述为:

（A）对于偶数N

N\geq 6\Rightarrow D(N)=\sum_{p_{1}+p_{2}=N,p_{1},p_{2}Is a prime number}1>0

(B)  对于奇数N

N\geq 9\Rightarrow T(N)=\sum_{p_{1}+p_{2}+p_{3}=N.p_{1},p_{2},p_{3}\geq 3}1>0

        这就是著名的哥德巴赫猜想，如果命题（A）真，那么命题（B）真，所以，只要我们证明命题（A），立即推出猜想（B）是正确的

         

§2相关集的构造
A_{0}=\left \{ 0+0,0+1,0+2,\cdots  \right \}

A_{1}=\left \{ 1+0,1+1,1+2,\cdots  \right \}

A_{2}=\left \{ 2+0,2+1,2+2,\cdots  \right \}

\cdots

A=\bigcup_{i=0}^{\infty }A_{i}\Rightarrow B(N)=\sum_{n_{1}+n_{2}=N.0\leq n _{1},n_{2}\leq N}1,B(x,N)=\sum_{N\leq x,B(N)\neq 0}1      （1）

p_{0}=2,p_{1}=3,p_{2}=5,\cdots C_{0}=\left \{ p_{0} +p_{0},p_{0}+p_{1},p_{0}+p_{2},\cdots \right \} C_{1}=\left \{ p_{1} +p_{0},p_{1}+p_{1},p_{1}+p_{2},\cdots \right \} C_{2}=\left \{ p_{2} +p_{0},p_{2}+p_{1},p_{2}+p_{2},\cdots \right \} C=\bigcup_{i=0}^{\infty }C_{i}\Rightarrow D(N)=\sum_{p_{1}+p_{2}=N.p_{1},p_{2}\geq 3}1\wedge M(x)=\sum_{N\leq x,D(N)\neq 0}  （2）      

  §3    预备定理
定理 1

M_{i}=(x_{1}^{(i)},x_{2}^{(i)},\cdots ,x_{i}^{(i)},\cdots ),Is a countable set\Rightarrow M=\bigcup_{i=1}^{N}M_{i},Is a countable set

  .Proof: Suppose M_{1},M_{2},\cdots ,M_{N},Is a countable set, M=\bigcup_{i=1}^{N}M_{i}

\because M_{1}:x_{1}^{(1)},x_{2}^{(1)},x_{3}^{(1)},\cdots ,x_{i}^{(1)},\cdots

M_{2}:x_{1}^{(2)},x_{2}^{(2)},x_{3}^{(2)},\cdots ,x_{i}^{(2)},\cdots

M_{N}:x_{1}^{(N)},x_{2}^{(N)},x_{3}^{(N)},\cdots ,x_{i}^{(N)},\cdots

\cdots

\therefore M:x_{1}^{(1)},x_{1}^{(2)},\cdots ,x_{1}^{(N)},x_{2}^{(1)},x_{2}^{(2)},\cdots ,x_{2}^{(N)},\cdots Countable

     定理2 (素数定理)

\pi (x)\sim \frac{x}{logx}^{\left [ 1 \right ]}

      定理3  对于偶数x

x>800000\wedge M_{1}=minM(x)\Rightarrow M_{1}(x)=\frac{1}{2}\pi (x)\left [ \pi (x) -1\right ]

证明 根据定理1, (1)  

  \because A_{i},A_{j} Countable,

\therefore A Countable\wedge B(x,N)=\frac{1}{2}(N+1)(N+2)
类似地，根据定理1, (2), C可数  
4 }1 Q4 \/ N1 ~* ^9 O

设      M_{1}(x)=minM(x)

根据（2），那么我们有.
M_{1}(x)=\frac{1}{2}\pi (x)\left [ \pi (x)-1 \right ]

定理4  对于偶数x

x>800000\wedge M_{2}(x)=maxM(x)\Rightarrow M_{2}(x)=4\pi (\frac{x}{2})\pi (x)-2\pi ^ {2}(\frac{x}{2})-3\pi (\frac{x}{2})-\pi ^{2}(x)+\pi (x)                        （3）

证明: 根据（2），那么我们有
  M(x)=\sum_{N\leq x,D(N)\neq 0}1< \sum_{3\leq p_{1},p_{2}\leq \frac{x}{2}}1+\sum_{3\leq p_{1}\leq \frac{x}{2},\frac{x}{2}< p_{2}< x}+\sum_{\frac{x}{2}<p _{1}< x,3\leq p_{2}\leq \frac{x}{2}}

     设   M_{2}(x)=maxM(x)

\therefore M_{2}(x)

=\frac{1}{2}\cdot 2\pi (x)\left [ 2\pi (\frac{x}{2})-1 \right ]-\frac{1}{2}\left [ 2\pi (\frac{x}{2})-\pi (x) \right ]\left [ 2\pi (\frac{x}{2})-\pi (x) +1\right ]\cdot 2

=4\pi (x)\pi (\frac{x}{2})-2\pi ^{2}(\frac{x}{2})-3\pi (\frac{x}{2})-\pi ^{2}(x)+\pi (x)

§4 Goldbach's problem 终结
定理 5  对于偶数N

N> 800000\Rightarrow D(N)\geq 1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}

    证明: 根据定理2
* i8 W9 ^4 f$ z4 B$ {6 i+ P N> 800000\Rightarrow \alpha \frac{N}{logN}\leq \pi (N)\leq \beta \frac{N}{logN}      (4)

让  c_{1}=min(\alpha ,\beta ),

根据定理3，然后我们有
1 f1 [; V0 G' }# C! A      D_{1}(N)=M_{1}(N)-M_{1}(N-2)

显然
  [% t& }9 D& Z8 U       D(N)\geq D_{1}(N)

\because log(1+x)=\int_{0}^{x}\frac{dt}{1+t}=x-\int_{0}^{x}\frac{t}{1+t}dt

\because x\geq-\frac{1}{2} \Rightarrow log(1+x)=x+o(x^{2})           (5)

\therefore D_{1}(N)=2c_{1}^{2}(1-\frac{1}{logN})\frac{N}{log^{2}(n-2)}+o(1)

N\rightarrow \infty ,o(1)\rightarrow 0\Rightarrow

D(N)\geq 1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}

定理6  对于偶数N

N> 800000\Rightarrow D(N)\leq

5.0176\left [ 1+\frac{2}{logN}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}

证明: 根据(4)

让  c_{2}=max(\alpha ,\beta )

根据定理4，然后我们有
       D_{2}(N)=M_{2}(N)-M_{2}(N-2)

\because D(N)\leq D_{2}(N)

根据(5)，那么我们有
, b7 }1 e0 Y8 G/ j       D(N)\leq

5.0176\left [ 1+\frac{2}{logN}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}

定理7 (Goldbach Theorem)  

对于偶数N

N\geq 6\Rightarrow D(N)= \sum_{p_{1}+p_{2}=N,p_{1},p_{2}\geq 3}1\geq 1

证明: 根Shen Mok Kong 的验证
      6\leq N\leq 3.3\times 1000000^{\left [ 3 \right ]}\Rightarrow D(N)\geq 1

根据定理5, 定理 6, 然后我们有
      N> 800000\Rightarrow 1.8432(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}\leq D(N)\leq 5.0176\left [ 1+\frac{2}{logN}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}

\therefore N\geq 6\Rightarrow D(N)\geq 1

引理1 对于奇数N

N\geq 9\Rightarrow

T(N)=\sum_{p_{1}+p_{2}+p_{3}=N,p_{1},p_{2},p_{3}\geq 3}1\geq 1

证明: 让 n\geq 4

\because 2n+1=2(n-1)+3

根据定理7，然后我们有
      N\geq 9\Rightarrow T(N)\geq 1

    References

[1]  Wang yuan,TANTAN SUSHU,Shanghai, Shanghai Education Publishing House(1983),42.

[2]  U﹒Dudley,Elementary number theory, Shanghai, Shanghai Science and Technology Press,(1980),195.

[3] Pan Chengdong,Pan Chengbiao,Goldbach conjecture,Beijing,Science Publishing house,(1984),1.

数学1+1

我国数学家华罗庚，闵嗣鹤均对M(x)的下界做过研究，潘承洞，潘承彪对D(N)的上界做过研究，他们留下了遗憾，也留下了经验.

数学1+1

D(N)=\sum_{p_{1}+p_{2}=N,p_{1},p_{2}\geq 3}1\wedge
1.83150(1-\frac{1}{logN})\frac{N}{log^{2}(N-2)}\leq D(N)\leq 4.36166\left [ 1+log\frac{2}{N}+o(1) \right ]\frac{N}{log\frac{N-2}{2}log(N-2)}

数学1+1

若N＞800000，
则   1.83150（1－1／logN）[N／log^2(N-2)]≤D(N) ≤4.36166[1+2／logN +o(1)]×
N／{log[(N-2)／2]log(N-2)}
这就是哥德巴赫公式，有兴趣的读者不妨检测一下。

1300611016

楼主的帖子怎么样？赶紧试试这里的快速回复给楼主点评论

1300611016

太烦，可以用一个简明的形式，如·同偶质数对·形式展开详细见http://www.madio.net/thread-202136-1-1.html
一般的用简明浅显的形式表述更容易推广，如能用初等数学表述这一问题，可以尝试一下。但不妨碍专业研究。