<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Small gaps between primes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1311.4600/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1311.4600/feed.xml" rel="self" type="application/rss+xml" /><item><title>Small gaps between primes — mentioned by fspeech</title><link>https://news.ycombinator.com/item?id=6769145</link><guid isPermaLink="false">urn:hackerpapers:mention:1311.4600:6769145</guid><pubDate>Wed, 20 Nov 2013 16:51:42 GMT</pubDate><description>&lt;p&gt;Okay it appears that you and several others have not read the preprint paper. The article&amp;#x27;s wording is a bit confusing but if you think carefully you&amp;#x27;d realize that a later work can not be independent of an earlier well known result. The article does have a link to Maynard&amp;#x27;s preprint: http://arxiv.org/pdf/1311.4600v1.pdf Here is an expert overview of the situation: http://www.dms.umontreal.ca/~andrew/CEBBrochureFinal.pdf &amp;quot;In April 2013, Yitang Zhang proved the existence of a nite bound B such that there are in nitely many pairs of distinct primes which di er by no more than B. This is a…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1311.4600/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.NT</category></item><item><title>Small gaps between primes — mentioned by mrcactu5</title><link>https://news.ycombinator.com/item?id=6768723</link><guid isPermaLink="false">urn:hackerpapers:mention:1311.4600:6768723</guid><pubDate>Wed, 20 Nov 2013 15:55:15 GMT</pubDate><description>&lt;p&gt;I knew about the Wiki http://michaelnielsen.org/polymath1/index.php?title=Bounded_... However, I did not know about the solo paper http://arxiv.org/abs/1311.4600 In their celebrated paper [5], Goldston, Pintz and Yıldırım introduced a new method for counting tuples of primes, and this allowed them to show that [eq 1.1] The recent breakthrough of Zhang [9] managed to extend this work to prove [eq 1.2] &amp;quot;Sieve methods&amp;quot; say integer properties like divisibility are essentially random. This is how we can show two integer randomly chosen are relativley prime with probabilty pi²/6= 0.608...…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1311.4600/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.NT</category></item></channel></rss>
