Goldbach问题的比较筛法.pdfVIP

Comparative Sieve Method for the Goldbach Problem Fu-Gao Song College of Science Shenzhen University Shenzhen, P. R. China 518060 songfg ao@szu . Abstract Goldbach problem can be solved by using “the comparative sieve method”, in which a set of integers and its compared subset will be sifted simultaneously. By comparing the difference between the sifting function and the compared sifting function we can prove that there must be a large number of primes in the sifting function ; this fact already enough proves the correctness of both the Goldbach problem and the problem of twin primes. On an added bonus, the indeterminacy of the sifting functions brought about by their upper and lower bounds can be eliminated, thereout, we can further obtain the first approximations for both problems. Keywords: Comparative sieve method; Selberg’s sieve; Goldbach problem; problem of twin primes. 1 Introduction In this paper, the term “Proposition {1, b }” means that every large even number can be expressed as the sum of a prime and the product of at most b primes. A . Rényi [ 13] proved in 1948, using Линник’s large sieve [9], that there must be a positive constant η0 such that the following estimation of the remainder term holds for any positive real numbers η η0 and A 0 : 2 y ⎛ x ⎞ R x