<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A variant of the Euclid-Mullin sequence containing every prime · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1605.08929/</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/1605.08929/feed.xml" rel="self" type="application/rss+xml" /><item><title>A variant of the Euclid-Mullin sequence containing every prime — mentioned by JadeNB</title><link>https://news.ycombinator.com/item?id=20017285</link><guid isPermaLink="false">urn:hackerpapers:mention:1605.08929:20017285</guid><pubDate>Sun, 26 May 2019 20:27:04 GMT</pubDate><description>&lt;p&gt;A way less interesting comment on the Euclid–Mullin sequence, for anyone who&amp;#x27;s just learned about it in a math class: it is common to take away the wrong lesson &amp;quot;the product of all the primes so far, plus 1, is always prime.&amp;quot; (Even if it&amp;#x27;s totally obvious to you that this is false, I assure you that it&amp;#x27;s not obvious to everyone. Sigh, I&amp;#x27;ve also just noticed that, by skipping to the part of the article about interesting unsolved questions, I missed that the author says exactly this. Sorry! Hopefully the rest of the comment is worth something.) This succeeds for a little while, since (the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1605.08929/"&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>
