期刊文献+

The Goldbach Conjecture Is True

The Goldbach Conjecture Is True
下载PDF
导出
摘要 Let 2m>2, m∈ℤ, be the given even number of the Strong Goldbach Conjecture Problem. Then, m can be called the median of the problem. So, all Goldbach partitions (p,q)exist a relationship, p=m−dand q=m+d, where p≤qand d is the distance from m to either p or q. Now we denote the finite feasible solutions of the problem as S(2m)={ (2,2m−2),(3,2m−3),⋅⋅⋅,(m,m) }. If we utilize the Eratosthenes sieve principle to efface those false objects from set S(2m)in pistages, where pi∈P, pi≤2m, then all optimal solutions should be found. The Strong Goldbach Conjecture is true since we proved that at least one optimal solution must exist to the problem. The Weak Goldbach Conjecture is true since it is a special case of the Strong Goldbach Conjecture. Therefore, the Goldbach Conjecture is true. Let 2m>2, m∈ℤ, be the given even number of the Strong Goldbach Conjecture Problem. Then, m can be called the median of the problem. So, all Goldbach partitions (p,q)exist a relationship, p=m−dand q=m+d, where p≤qand d is the distance from m to either p or q. Now we denote the finite feasible solutions of the problem as S(2m)={ (2,2m−2),(3,2m−3),⋅⋅⋅,(m,m) }. If we utilize the Eratosthenes sieve principle to efface those false objects from set S(2m)in pistages, where pi∈P, pi≤2m, then all optimal solutions should be found. The Strong Goldbach Conjecture is true since we proved that at least one optimal solution must exist to the problem. The Weak Goldbach Conjecture is true since it is a special case of the Strong Goldbach Conjecture. Therefore, the Goldbach Conjecture is true.
作者 Jie Hou Jie Hou(HQ Building Design Inc., Oshawa, Canada)
出处 《Open Journal of Discrete Mathematics》 2024年第3期29-41,共13页 离散数学期刊(英文)
关键词 MEDIAN The Feasible Goldbach Partitions The Optimal Goldbach Partitions CONGRUENCES Effacement Median The Feasible Goldbach Partitions The Optimal Goldbach Partitions Congruences Effacement
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部