<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The ternary Goldbach problem · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1501.05438/</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/1501.05438/feed.xml" rel="self" type="application/rss+xml" /><item><title>The ternary Goldbach problem — mentioned by jordigh</title><link>https://news.ycombinator.com/item?id=50284927</link><guid isPermaLink="false">urn:hackerpapers:mention:1501.05438:50284927</guid><pubDate>Thu, 29 Oct 2026 05:36:21 GMT</pubDate><description>&lt;p&gt;We often write &amp;quot;otherwise&amp;quot; in mathematics: https://arxiv.org/html/1501.05438v2#:~:text=otherwise,-%2C https://arxiv.org/html/1302.5008v3#:~:text=otherwise https://arxiv.org/html/1501.05438v2#:~:text=otherwise,-%2E In fact, I think that&amp;#x27;s the most common alternative, not &amp;quot;else&amp;quot;.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1501.05438/"&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>The ternary Goldbach problem — mentioned by gizmo686</title><link>https://news.ycombinator.com/item?id=37267614</link><guid isPermaLink="false">urn:hackerpapers:mention:1501.05438:37267614</guid><pubDate>Fri, 25 Aug 2023 22:10:04 GMT</pubDate><description>&lt;p&gt;&amp;gt; why not numbers that can only be produced by adding 3 primes together? Goldbach&amp;#x27;s weak conjecture: Every odd number greater than 5 can be expressed as the sum of three primes. First proposed in 1742, and proven in 2013 [0]. The original proposal considered even numbers as well, nowadays those are covered by Goldbach&amp;#x27;s strong conjecture, with a tighter bound of 2 primes. &amp;gt; why not only numbers that can be produced by multiplying squares greater than 1? You mean squares containing at least 2 distinct prime factors? Fully classifying this set of integers would fit well on an undergrad intro to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1501.05438/"&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>
