TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

First proof that infinitely many prime numbers come in pairs (2013)

21 点作者 valera_rozuvan将近 10 年前

3 条评论

nathan_f77将近 10 年前
Oh, this is from 2013. I was getting excited to read about a new discovery.
评论 #10005747 未加载
评论 #10005808 未加载
评论 #10006272 未加载
daniel-levin将近 10 年前
No, this is absolutely <i>not</i> the first (correct) proof that infinitely many prime numbers come in pairs! That is the twin prime conjecture, and at the time of writing this comment, steadily remains a conjecture. I wonder why <i>Nature</i>, a publication held in high regard, would publish an article with such a title. This is not to say that the result is anything less than incredible.<p>Terence Tao delivered a very good lecture on this result here [0]<p>[0] <a href="https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=pp06oGD4m00" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=pp06oGD4m00</a>
评论 #10006194 未加载
评论 #10006120 未加载
AnimalMuppet将近 10 年前
Note: 2013.
评论 #10005690 未加载