About 魏继水

He did not prove anything. See
http://bbs.tech.sina.com.cn/?h=http%3A//bbs.tech.sina.com.cn/g_forum/00/39/00/view.php%3Ffid%3D59437%26tbid%3D3255&g=8

I modified his statement as

For every integer m>1, there is a integer
series 0<=n1
m-n1, m+n1, n2-m, n2+m, n3-m, n3+m,...

are all primes.

prove that it is a combination of the Goldbach and Polignac's
conjectures.

Polignac's
conjecture:

Every even number is the difference of two consecutive primes in infinitely many ways

A weaker form of Polignac's conjecture: Every even number is the difference of two primes.

所有跟帖： 

• Very interesting. These number theory conjectures seem to remain -乱弹- ♂ (0 bytes) () 05/17/2007 postreply 10:42:55

• the hardest. -乱弹- ♂ (0 bytes) () 05/17/2007 postreply 10:43:16