猜想: |2i - 2293| 总是合数对于任意自然数i=0,1,2,3,...
Conjecture: |2i - 2293| is always composite(never be prime) for any non-negative integer i=0,1,2,3,...

2019-09-02,中国科大毕业的程序员 Cody Luo(cody@ ustc.edu),即2293.ml的站长, 在github.com/a-boy/playmath给出了Goldbach's Conjecture的一个证明(Sagemath Jupyter文档),采用"分配各不相同质因数"的方法,发现并证明了两个简洁的不等式:

Goldbach Conjecture Inequality 1: gold(n) < prime_pi(n)+sigma(n,0)
	gold(n): the min non-negative integer makes that both n-g and n+g are primes
	prime_pi(n): the count of primes in 1..n
	sigma(n,0): the count of n.divisors()

gold(n) < prime_pi(n), while n>344  
gold(n) < prime_pi(n)*4395/3449751 ≈ prime_pi(n)*0.0013, while n>57989356

Goldbach Conjecture Inequality 2: gold(n) < prime_pi(prime_pi(n)+n)
----
github/2293
a-boy.tk ~ playmath rush
QQ群 499866721 纯情部落火星人学习班

----
一起进步! 谢谢支持!