陈景润的”1+2“.pptVIP

第二组ppt伟大的中国数学家陈景润 组长：高勇 组员： 张浩 戢增辉 分工： ppt制作：戢增辉 张浩 高勇 演讲：高勇 A. each not less than 6 even is the sum of two odd primesA.每个不小于6的偶数都是两个奇素数之和B. each not less than 9 the odd Numbers are the sum of three odd primes .b.每个不小于9的奇数都是三个奇素数之和。 First Man Of Goldbach conjecture 哥德巴赫猜想第一人 Chen jingrun 陈景润 Verification Work :6 = 3 + 3, 8 = 3 + 5.10 = 5 + 5 = 3 + 7,12 = 5 + 7,14 = 7 + 7 = 3 + 11,16 = 5 + 11, 18 = 5 + 13,...And so on.验证工作: 6 = 3 + 3, 8 = 3 + 5, 10 = 5 + 5 = 3 + 7, 12 = 5 + 7, 14 = 7 + 7 = 3 + 11,16 = 5 + 11, 18 = 5 + 13, ……等等。 Someone have a checking calculation to 33 x 108 which less than 6 and greater than the one even to check computations; Conclusion prove that Goldbach conjecture (a) are established. But strict mathematical proof is so far and no one can be obtained.有人对33×108以内且大过6之偶数一一进行验算，哥德巴赫猜想(a)都成立。但严格的数学证明至今没有人能够给出。  In 1920, Norwagian mathematician Brown come up with a kind of old screen method to prove, and reach a conclusion: each a relatively large even number can be expressed as (9 + 9).1920年挪威数学家布朗用一种古老的筛法证明，得出了一个结论：每一个比较大的偶数都可以表示为（9+9）。 Browns screen method train of thought is this:Any even number (natural number) can write to 2 n, here n is a natural number. 2 n can be expressed as n different forms of a pair of natural number of:2 n = 1 + (2 n - 1)= 2 + (2 n - 2)= 3 + (2 n - 3)=...= n + n布朗筛法的思路是这样的： 任一偶数(自然数)可以写为2n，这里n是一个自然 数。2n可以表示为n个不同形式的一对自然数之和：  2n =1+(2n-1) =2+(2n-2) =3+(2n-3) =… =n+n Then screen out which number is not suitable for goldbach conjectures conclusion, later, if can prove that there is at least a pair of natural number which is not screen out, for example, to remember one of the pair is p1 and p2, p1 and p2 is prime, vested n = p1 + p2, such goldbach conjecture is proved.再筛去不适合哥德巴赫猜想结论的所有那些自然数对之后，如果能够证明至少还有一对自然数未被筛去，例如记其中的一对为p1和p2，并且p1和p2都是素数，即得n=p1+p2，这样哥德巴赫猜想就被证明了。 This narrowing range of the way is very useful, so scientists began to (9+9)