<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A proof of the Erdős primitive set conjecture · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2202.02384/</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/2202.02384/feed.xml" rel="self" type="application/rss+xml" /><item><title>A proof of the Erdős primitive set conjecture — mentioned by tromp</title><link>https://news.ycombinator.com/item?id=35926424</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.02384:35926424</guid><pubDate>Sat, 13 May 2023 07:37:19 GMT</pubDate><description>&lt;p&gt;This appears as the 2nd-last solved conjecture on the List of conjectures by Paul Erdős [1] with 3 references, the first being Jared&amp;#x27;s paper [2], the 2nd a quanta magazine article [3] and the 3rd this Numberphile video. [1] https://en.wikipedia.org/wiki/List_of_conjectures_by_Paul_Er... [2] https://arxiv.org/abs/2202.02384 [3] https://www.quantamagazine.org/graduate-students-side-projec...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.02384/"&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>A proof of the Erdős primitive set conjecture — mentioned by dragon96</title><link>https://news.ycombinator.com/item?id=31648280</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.02384:31648280</guid><pubDate>Tue, 07 Jun 2022 00:16:33 GMT</pubDate><description>&lt;p&gt;For anyone interested in a more technical summary of the some of the main ideas: Problem Statement The Erdos conjecture that all primitive sets S satisfy f(S) &amp;lt;= f(PRIMES), where f(S) = sum_{s} (1/(s log s)) and PRIMES is the set of all primes. Definitions Define A_q to be a primitive set such that all elements a are divisible by prime q, but no primes less than q. * Example: A_3 contains multiples of 3, but no even numbers. Define A*_q to be the set of all integers divisible by only primes &amp;gt;= q. * Example: A_q is a subset of A*_q. * Example: A_q is also a subset of q \* A*_q (i.e. multiply…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.02384/"&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>A proof of the Erdős primitive set conjecture — mentioned by rob_c</title><link>https://news.ycombinator.com/item?id=31647671</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.02384:31647671</guid><pubDate>Mon, 06 Jun 2022 23:13:22 GMT</pubDate><description>&lt;p&gt;For anyone who speaks maths https://arxiv.org/abs/2202.02384 Unfortunately without a maths UG it&amp;#x27;s a hard slog I&amp;#x27;ll agree, but not the most impenetrable paper over ever seen. Not going to pretend I get the subtleties though.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.02384/"&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>A proof of the Erdős primitive set conjecture — mentioned by nabla9</title><link>https://news.ycombinator.com/item?id=31642861</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.02384:31642861</guid><pubDate>Mon, 06 Jun 2022 16:54:51 GMT</pubDate><description>&lt;p&gt;&amp;gt; Mathematicians noted that the work is particularly striking because it relies entirely on elementary arguments. “It wasn’t like he was waiting for all this crazy machinery to develop,” Thompson said. “He just had some really clever ideas.” the proof: https://arxiv.org/pdf/2202.02384.pdf Last time I saw something so simple that I think I could understand the idea because it has not too many new concepts was Hao Huang Sensitivity Conjecture: http://www.mathcs.emory.edu/~hhuan30/papers/sensitivity_1.pd... Donald Knuth further simplified it into one page…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.02384/"&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>A proof of the Erdős primitive set conjecture — mentioned by Victerius</title><link>https://news.ycombinator.com/item?id=31642338</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.02384:31642338</guid><pubDate>Mon, 06 Jun 2022 16:15:10 GMT</pubDate><description>&lt;p&gt;Link to Arxiv pre-print: https://arxiv.org/abs/2202.02384&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.02384/"&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>
