关于哥德巴赫猜想的证明(美国康奈尔大学) 英文原版论文 (抢先发布).pdfVIP

A PROOF OF THE GOLDBACH CONJECTURE 1 SHAN-GUANG TAN 1 0 2 Abstract. The Goldbach conjecture was proved in this paper. The proof was by contradiction based on the fundamental theorem of arithmetic and the t c theory of Linear Algebra. First, by an assumption, the Goldbach conjecture O was converted into a group oflinearequations. Then, byinvestigating solutions to the group of linear equations, reductions to absurdity were derived to prove 6 the assumption false. Hence, the Goldbach conjecture was proved that even 1 numbers greater than 2 can be expressed as the sum of two primes. ] M G Introduction . h Goldbach’s conjecture is one of the oldest unsolved problems in number the- t a ory and in all of mathematics. It states: Every even number greater than 2 is a m Goldbach number, a number that can be expressed as the sum of two primes[1-7]. [ For small values of even numbers N , the Goldbach conjecture has been verified for N ≤ 1.609 × 1018 and some higher small ranges up to 4 × 1018 by T. Oliveira e 1 v Silva[1]. 5 Considerable work has been done on the weak Goldbach conjecture[1]. 6 The strong Goldbach conjecture is much more difficult. Chen Jingrun showed in 4 1973 using the methods of sieve theory that every sufficiently large even num