Comparative Sieve Method for the Goldbach Problem
首发时间:2006-04-03
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.
点击查看论文中文信息
Goldbach问题的比较筛法
摘要:可以用“比较筛法”解决Goldbach问题,在其中,一个整数集合和它的对照子集将同时过筛. 通过比较筛函数与对照筛函数的差别可以证明在筛函数中存在大量的素数,这一事实已足以证明Goldbach问题和孪生素数问题的正确性. 一个额外的收获是可以消除由筛函数的上下界所带来的不确定性,从而进一步得到两个问题的精确的一级近似结果.
关键词: 比较筛法 Selber筛法 Goldbach问题 孪生素数问题
基金:
论文图表:
引用
No.6043210581144038****
同行评议
勘误表
Goldbach问题的比较筛法
评论
全部评论0/1000