偶数Goldbach猜想证明的一种新模型刻画

基于偶数Ne独立封闭运算概念和＂偶数和＂同余表达定理,提出满足偶数Goldbach猜想要求的＂扩展中国剩余定理＂新模型,借鉴HASH函数中＂生日碰撞＂模式,证明了任一偶数Ne,在modM（Ne）模型中对应不同概率θ下,只要随机计算约r＇√Ne个Q中元素qj（1≤j≤r）,结果就能选对一个给定偶数内的素数满足偶数Goldbach数G（Ne）的配对要求,并得到对应不同θ的最低计算量r的下界范围为：0.325√Ne≤r≤2.146√Ne,（0.10≤θ≤0.99）从而证实了任一偶数Ne,在modM（Ne）和ModM（o）模型中,以及相关模型中至少有一式满足偶数Goldbach猜想的配对要求。

A New Model Depiction of Proving Even Goldbach Conjecture

Based on the independence and closed the calculation conception of even number Ne , and the congruence expression theorem of ＂even sum＂, a new model of Expansive Chinese Remainder Theorem （ECRT） that the require of satisfied with Even Goldbach conjecture is proposed. In this paper, it refer the form of＂birthday collision＂ in Hash functions, and here have proved that any even number Ne of corresponding with different probabilities θ in modM（Ne） , if only random computing r＇（Ne）（1/2） number volume of the element qj （1 ≤ j≤ r） in Q , the result can be right selected a prime, and satisfy with the pairing requirement of Even Goldbach Number G（Ne ） . The same time obtain that the lower bound range of lowest computing numbers r that it corresponding to qj can be appear a prime and satisfy with the requirement of G（Ne ） in each different probabilities θ way is given as follows： 0.325√Ne ≤ r ≤ 2.146 √Ne, （ 0.10 ≤ θ ≤ 0.99 ） Therein, when the probabilities θ = 0.10 , r ≈0.325√Ne;θ = 0.5 , r ≈ 0.833√Ne; θ = 0.99 , r ≈ 2.416√Ne. The result is verified that in modM（Ne ） and ModM（o） , which at least have a pair formula is satisfied with the requirement of pairing relation of even Goldbach conjecture.