这一事实已足以证明Goldbach问题和孪生素数问题的正确性
一个额外的收获是可以消除由筛函数的上下界所带来的不确定性
一个整数集合和它的对照子集将同时过筛
通过比较筛函数与对照筛函数的差别可以证明在筛函数中存在大量的素数
) 摘要: 可以用“比较筛法”解决Goldbach问题
) 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
下载PDF阅读器 PDF全文下载: 初稿 ( 355 ) 作者简介: 通信联系人: 【收录情况】 中国科技论文在线: 宋富高
Goldbach问题的比较筛法[EB/OL]
北京:中国科技论文在线
Goldbach问题
Selber筛法
从而进一步得到两个问题的精确的一级近似结果
关键词: 比较筛法
孪生素数问题 Fu-Gao SONG * ( College of Science, Shenzhen University
总览 评价 宋富高 * ( 深圳大学 理学院