看板 Math
作者
標題 [新聞] 兩個質數猜想
時間 Tue May 14 13:15:06 2013
作者
標題 [新聞] 兩個質數猜想
時間 Tue May 14 13:15:06 2013
不知道新聞適不適合po版?
※
這兩天解析數論界相當忙碌,
因為兩個重要的質數猜想有重大進展;
首先是 odd Goldbach conjecture,
Conj. 每個大於 5 的奇數都可以寫成三個質數的和.
Helfgott 昨天在 Arxiv 上公布了
http://arxiv.org/abs/1305.2897 Major arcs for Goldbach's theorem
與他之前一篇論文
http://arxiv.org/abs/1205.5252 Minor arcs for Goldbach's problem
合起來算是解決了這個猜想.
※
另外有傳言 University of New Hampshire 的 Yitang Zhang (找不到資料?)
證明了一個弱的孿生質數猜想,
Conj. 有無限組質數對 (p,q) 滿足 |p - q| < N.
http://www.math.columbia.edu/~woit/wordpress/?p=5865
http://www.nature.com/news/first-proof-that-infinitely-many-prime-numbers-come-in-pairs-1.12989
First proof that infinitely many prime numbers come in pairs : Nature News & Comment
Mathematician claims breakthrough towards solving centuries-old problem. ...
Mathematician claims breakthrough towards solving centuries-old problem. ...
![[圖]](http://www.nature.com/polopoly_fs/7.10508.1368533281!/image/IMAG1131%20copy.jpg_gen/derivatives/box_118/IMAG1131%20copy.jpg)
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 50.151.211.17
推 :!1F 05/14 13:30
推 :!2F 05/14 13:51
推 :!3F 05/14 14:39
推 :之前 abc 猜想證明的驗證完成了嗎?4F 05/14 15:13
推 :5F 05/14 15:51
推 :GJ!6F 05/14 18:05
推 :!7F 05/14 20:00
推 :贊8F 05/14 21:52
推 :Tao 的google plus有一些comment...9F 05/14 22:13
推 :cool!10F 05/14 22:31
推 :數論專家要不要出來科普一下啊11F 05/14 23:11
推 :可喜可賀 有生之年知道被證明出來...
子孫只要燒火鳳給我就夠了 T_T12F 05/14 23:47
子孫只要燒火鳳給我就夠了 T_T12F 05/14 23:47
The Paradox of the Proof | Project Wordsworth
Project Wordsworth is a collective of 17 Columbia Journalism School graduate students who are running an experiment—and you’re already a part of it. Each of us has written a good story that transports you somewhere else, somewhere you’ve never been. That’s worth something. But how much? You decide. ...
Project Wordsworth is a collective of 17 Columbia Journalism School graduate students who are running an experiment—and you’re already a part of it. Each of us has written a good story that transports you somewhere else, somewhere you’ve never been. That’s worth something. But how much? You decide. ...
→ :主要是 Mochizuki 用了太多沒人看得懂的語言, 然後又沒有回應大家的疑惑, 所以...16F 05/15 01:37
推 :wow18F 05/15 02:01
推 :lol19F 05/15 05:07
推 :我昨天沒有去聽 zhang 的演講 XD
早知道是這麼大的東西我就去了 XD20F 05/15 09:58
早知道是這麼大的東西我就去了 XD20F 05/15 09:58
→ :更新一下, Tao 發起了 polymath 試著減少 N, 目前為止最好的 N 大約是 25 萬.
剩下六萬出頭囉
剩下一萬二. 已經掉了快要四個數量級了...24F 06/15 12:59
剩下六萬出頭囉
剩下一萬二. 已經掉了快要四個數量級了...24F 06/15 12:59
--
--
(hcsoso.): [新聞] 兩個質數猜想 - FW板