<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Every odd number greater than 1 is the sum of at most five primes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1201.6656/</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/1201.6656/feed.xml" rel="self" type="application/rss+xml" /><item><title>Every odd number greater than 1 is the sum of at most five primes — mentioned by lmm</title><link>https://news.ycombinator.com/item?id=5703905</link><guid isPermaLink="false">urn:hackerpapers:mention:1201.6656:5703905</guid><pubDate>Tue, 14 May 2013 10:10:54 GMT</pubDate><description>&lt;p&gt;As I understand it this is largely a technical refinement of the argument from Tao&amp;#x27;s earlier paper http://arxiv.org/abs/1201.6656 , which is a bit shorter and very readable by the standards of such papers (though admittedly not exactly elementary)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1201.6656/"&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>Every odd number greater than 1 is the sum of at most five primes — mentioned by zitterbewegung</title><link>https://news.ycombinator.com/item?id=3963055</link><guid isPermaLink="false">urn:hackerpapers:mention:1201.6656:3963055</guid><pubDate>Sat, 12 May 2012 06:53:58 GMT</pubDate><description>&lt;p&gt;The paper that is referenced in the article http://arxiv.org/pdf/1201.6656.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1201.6656/"&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>
