博士家园

math1 发表于 2013-2-19 11:36:07 | 显示全部楼层 |阅读模式
The Goldbach's conjecture proved
Authors: Agostino Prástaro
(Submitted on 13 Aug 2012 (v1), last revised 8 Feb 2013 (this version, v8))
Abstract: We give a direct proof of the Goldbach's conjecture, (GC), in number theory, in the Euler's form. The proof is also constructive, since it gives a criterion to find two prime numbers $\ge 1$, such that their sum gives a fixed even number $\ge 2$. The proof is obtained by recasting the problem in the framework of the Commutative Algebra and Algebraic Topology.
Even if in this paper we consider 1 as a prime number, our proof of the GC works also for the restricted Goldbach conjecture, (RGC), i.e., by excluding 1 from the set of prime numbers.
http://arxiv.org/abs/1208.2473
回复

使用道具 举报

关于我们|手机版|博士家园 ( 沪ICP备15045866号 )(沪公网安备沪公网安备 31011702001868号) 

GMT+8, 2018-4-19 23:50 , Processed in 0.286867 second(s), 21 queries , Gzip On.

Powered by Discuz! X3.2

© 2004-2017 Comsenz Inc.

快速回复 返回顶部 返回列表