哥德巴哈猜想 Goldbach Conjecture

看來「好怕Homework」冇仔細睇個proof.
其實個proof係Page 4, Def 1.1 就已經唔work.

The last prime in the Goldbach block pn = m - p0
根本唔係一個prime

楝一個例子一個even number 減 3唔係prime非常容易, 例如12就唔得。

2008-02-29 00:47:16 補充：
Eq 2.0 都唔掂啦，都冇define咩係p_(n+1)

2008-02-29 01:10:41 補充：
The true problem is Corollary 1.1.

The statement is for any prime p_a, r_a, r_t, p_q.
If k-(p_a + r_a + r_t) = p_q, then p_q + (k - p_q) is a goldbach partition.

2008-02-29 01:10:46 補充：
However, the proof requires p_a + r_a + r_t to be a prime number to start with, which is not stated as an assumption for the corollary.

Check the usage on the last page, the use of corollary do not check the unstated assumption as well.

我表面看上去這個proof是倒果為因。他能夠找到個模式是因為哥德巴哈猜想好可能是對的﹐而他就倒過來說可以用這個方法找到每一個偶數的2個對應質數。andrew大概講中了重點