Goldbach’s Theorem

数学1+1

7 n" C  ^9 @- U* u4 @1 P( h
javascript:;
( ?( l+ a! l& G, Q! B

  X; z+ z, G1 T: @3 l  |+ u

数学1+1

I havesubmitted a new manuscript titled "Goldbach Theorem" forconsideration by Annals of Mathematics.

! K& Y# I1 M$ O- K% ^# _

数学1+1

' g; D: h! U1 p9 x+ o: M
  I0 p0 {6 O8 T. ?

% z$ P  M. s' Z0 v2 G- x" P

数学1+1

* _, R( A* [7 N6 L" }
摘要:我们定义素数和的集合是所有整数的集合，p + p’（素数p，p’不小于3）的形式，记录为M（x），根据带有误差的素数定理估计M（x）的极值，使用Newton-Leibniz公式计算M（x）的值差，然后推导哥德巴赫定理。
7 w' a7 u1 P  C; `9 m  关键词:偶数，哥德巴赫，素数和集合，常数
  MR（2010）主题分类11P32

' z' U: S+ d5 U- l# {9 }8 j/ E8 ?



3 A  d9 B& H) E( W6 C) A






) ]9 @% {: R/ h; q2 D3 Y( E  a

  P% O% o& r" D; \9 M& `; x
) ]) E' @/ H* [  z

0 S  e6 ?2 X! x; Q7 m
" z+ S  E: c! L( ?$ A! M2 O


( D8 q1 \; D' K+ P; D, K3 F  T
0 E( L* B5 ~4 l3 {
1 K. q. [) a! Y, {; \
3 u6 C, w- ?! {% {+ ^' J% ?1 T/ V/ S
4 X+ _( P& C: S* Q3 W: K: s6 ~

3 F( o; e3 j/ a5 d


1 l0 ~5 Y5 c! v
5 B8 f2 w6 o* k

  o; ~0 _( I7 q: N1 E+ J; y  D
: s- J5 v+ ^1 H
1 i6 d: G2 u. u4 V( E, I$ ~$ o# e
/ z9 g( F1 y9 c$ g- m
# a( j) C; U1 \# r7 p5 M
$ u9 o2 q8 s; D
9 \# U: l) L$ I

5 G% T6 r0 ]9 U; D& Z4 [
) E. j; s. a/ z( q, e; y2 X
+ T& ?9 s6 _( K" ~
8 G' z- u, `) h5 f: F$ G) `  _


0 q: E" F3 p  _* }9 \+ m! k
4 y, K+ K, Q# y# ^& D. q9 E. \
% v1 k0 g& ~; l2 ?9 [; ?

0 B# v" n/ `: x( @+ ^' g


, b8 ]. z% `- Z# g6 V  x. @/ [
- `' @, E2 i. y- L0 x; m& L# E



0 g1 f" B- S; p9 r: v
, P5 R: j3 G: p! @

" [1 U7 ^8 k' l% O8 N
. y0 d* X- ~6 e. u
; I. B9 o3 \" f6 E) y. c

9 A! a. F! s- r$ L$ K( z% J$ x
2 ]! O( I# E( b" b8 r! z4 X0 }

8 j* R; H  w  ~# J: Q  g) \


" Q3 s& X1 N, y4 V1 U8 L; I2 W

/ }. x! v, q& Z% {

9 K: V- w5 J% U+ X% \
: A- v  _; n( l


) D5 C4 M& Z% B9 Q4 C% H: k0 u) o9 f

) S4 g1 y% Y) B( N# E


, ^+ N0 |9 q* L8 f, m

7 u& _# O2 p4 |, g# R) ]! K9 {+ n) y
$ n  W4 Q) V* U& C
6 v- V$ O8 Q& L
: z( {: k$ @! G: r+ \. e$ E
% o4 o, P% L7 e
3 y: C# w& ^4 D. w( @! T4 \) p" i2 |9 O
8 ~& ?+ Z" N: G8 Y$ W/ ]
2 L9 @+ z' s0 }: \$ {

" {' Y& m. S  T" K; ]% P( A
# p2 |% n5 s, `+ p



. Q8 C5 L3 L$ @  R


6 `0 c' _! z0 h. v
4 U1 K$ [7 @6 I" n

- e7 B% E1 W$ \/ N+ C( v




+ C4 r: }1 N. T9 j6 {9 `4 R( |


) l" y# J3 z/ o3 s& d- N/ i

6 I3 u9 ?  Z& \  J: b8 c! y6 J+ v

4 \8 Q* c( t* Q8 G  e9 K; R






, k& E. {8 m" i( D9 {0 S0 a8 ]( D2 \

6 r5 h4 g5 o7 H3 ~, r& H# _8 Q  K9 N


+ n' _) I$ Z' p( j0 a# A% ?6 ]- k  ^5 K






  Q0 y8 m; ]1 O6 D/ h* ~
1 c& C4 {/ a( ^; i, T0 c
. n, v6 n; M) j+ ^- m. F4 F
- R& G4 r' r  Y7 [% D
* |  ]) N. _  G! v





# J) d6 b  y+ G& C8 t
. b, |* B6 r  g

: k+ n  y- j( q( T! r6 z



* E( i# A' U: k; \( G* n3 `

( W; m$ q& _/ h% |4 \




* u. T$ a0 a- j3 c: m! e0 \2 [4 T


  D) r+ G) ?  Q9 O1 n. y' P



! V, d; W( J7 X7 x4 C, V4 Z
  W: y6 W  V" U1 z5 |; m
& C5 Q; w+ h* H, b, m8 t9 B

4 M" Q: P; Z! a, N( _

, u" V$ P2 l' I+ ]
! B6 j" _. B! a/ g7 p) c. m, l- h

, t- _! S1 D$ ^
; C3 `1 a4 r) e+ m

# |5 Y9 _; q8 Z( S

" k( ?) U" h3 ^
4 _* Y/ W! F8 o( ~3 ~7 D
0 f8 v7 k) L: g9 Y
2 s- {1 y" H1 }, _


" b  K+ D  u# h% W6 {$ d. y: x
3 V( g$ t- f7 r# q9 w3 c) z8 l

6 v# `/ M( R. Q' m0 [+ h
' @! V, R' m7 w  @: ^

; V& \2 {2 o. T5 w& n2 [
2 S6 v; H# L; u* j9 P" C
  G  s; R1 u9 B: G% Z$ s


5 B, P6 Q  `3 d

9 n6 ]% D/ @' \5 C$ t$ h4 b8 Z

8 E' p% s) q* _
# [% {; _+ }! T" k

- D( x# J0 N+ ?+ }2 K7 K: A



4 T% s' H7 e6 Q" i! k



+ N  r  n6 J3 D' b% i8 q. d4 y

. K, ^3 x6 Z5 e9 E8 U( Y$ X3 A






4 Z6 N% h8 P0 U6 {


8 ^- f* w, n3 ]; D, N
; O8 L$ o& C0 |; B+ ^- i' J0 r


2 V  m' i# n# |" `+ N# w

7 ~$ l% g. [6 D; N6 }8 l


, A$ q$ d* s; B2 v: v; d' U% G

# D# X- `! Z  U* h: D
+ i% K. \5 P- x# ?& l. V) o
0 P" C" }6 {! N7 H# \$ S

* r$ i4 D5 K% |8 }: E


7 f1 i) R3 J; _( Q; ?' K$ E

1 o! g: l! N4 ~6 A
/ v* z0 B+ {$ t+ E+ V





" O, o$ i* C+ `' k% i) p
8 D% T: g/ g: H! \

' Q9 }5 ~2 V, I) r
3 \6 A6 c" H3 t- U' ^
( P$ L- ?' |. G1 R   

( j- `. A3 P( P  c4 d$ X



3 d5 {2 x' b0 o3 \( @5 u/ u

数学1+1

0 v' K5 b* J6 y9 r

数学1+1

Abstract  We Definition Collection of sums of prime numbers is a set all integers in,
9 `3 C5 \4 I  q* n0 P1 athe form of p+p’ (for Prime number p,p’ Not less than 3),which is recorded as M (x),According
- m& n6 f- T7 C% }to the prime number theorem with error termestimate the extreme value of M (x),
use the Newton-Leibniz formula to calculate the value difference of M (x), and
' z( h7 v0 T  ^# ]: p  d8 Lderive Goldbach Theorem.
0 R% n( E0 I4 x* t! v, @$ QKey words  even numbers, Goldbach, Collection of sums of prime numbers , constant
" [; M8 y; e- S- RMR(2010) Subject Classification  11P32

数学1+1

References
[1]        G. H. Hardy , E. M. Wright, An Introduction to the Theory of Numbers, People's Posts and Telecommunications Press, Beijing,2009,1-13.
0 O6 h- }0 f+ s; S9 m1 ~[2]        Hua Luogeng，An Introduction to the Theory of Numbers, Science Press, Beijing,1979.85-112
: O" S( S! b# H/ F[3]        Hua Luogeng，Hua Luogeng's anthology ｜ Number Theory Volume I｜ Science Press, Beijing,2010.199-217.
[4]        J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers, Ill. Journ. Math. 6 (1962) 64-94.
( c- Y2 ^. z3 V3 s7 w: u[5]        Knang Jichang, Applied inequalities, Shandong science and Technology Press,Ji'nan,2010.
4 f* ~" \7 v: d: S  ^9 [0 Z346-358.
; ?& h; p& }8 l# ]' W/ f8 V; _[6]        Pan Chengdong, Chinese Annals of Mathematics,Series B, 1982,3(4):555-560.
- J1 _# P1 a  z' e; r[7]        Pan Chengdong, pan Chengbiao，Analytical number theory basis，Harbin Institute of Technology Press，Harbin，2012,196-375.

* H% s) G  z; |7 |; W