Goldbach问题的筛函数按整数类别分割法.pdfVIP

Sifting Function Partition by Integer Sort for the Goldbach Problem (correction) Fu-Gao SONG College of Science, Shenzhen University, Shenzhen, P. R. China 5 18060 songfg ao@szu . Abstract All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so. Furthermore, the sifting out of all composite numbers is, in general, very difficult. A new method introduced in this paper shows that the Goldbach problem can be solved by using a combination of algebraic techniques and existing results from sieve theory under sifting out only some composite numbers. In fact, in order to prove the Goldbach conj ecture, it is only necessary to show that there are prime numbers left in the residual integers after the initial sifting! This idea can be implemented by using a method called “sifting function partition by integer sort”. Under this scheme, the integers are first classified according to their number of prime divisors; the sifting functions are then partitioned according to integer sort; the total number of integers in each class (containing the class of prime) is then determined by using the method of “separation of variables”; and the Goldbach conjecture is proved. This is a feasible method for solving both the Goldbach problem and the problem of twin primes. An added bonus of the above scheme is the elimination of the indeterminacy of the sifting functions