<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>An Elementary Problem Equivalent to the Riemann Hypothesis · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0008177/</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/math_0008177/feed.xml" rel="self" type="application/rss+xml" /><item><title>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=49672286</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:49672286</guid><pubDate>Sat, 12 Sep 2026 13:48:05 GMT</pubDate><description>&lt;p&gt;&amp;gt; Mathematicians know that you can make problems arbitrarily complex, and declaring problems with large prizes attached to them can lead to a lot of competition and drama. Yes, you can make problems arbitrarily complex. But the prize problems were chosen not just because the solutions appear likely to be very complex (the problem statements aren&amp;#x27;t necessarily inherently complex--there is a way to restate the Riemann hypothesis that a junior high school student could easily understand, which I&amp;#x27;ll give below). They were chosen because they were important problems that mathematicians really…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=39403646</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:39403646</guid><pubDate>Fri, 16 Feb 2024 22:12:40 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s a fairly easily understood problem, which if you could solve it would make you famous in the mathematical world and win you a million dollar prize: For a positive integer n: Let H(n) = 1 + 1/2 + 1/3 + ... + 1/n Let D(n) = the sum of the positive integers that divide n. E.g., D(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28. Prove or disprove that for any positive integer n &amp;gt; 1: D(n) &amp;lt; H(n) + exp(H(n)) log(H(n)) That easy to understand problem turns out to be equivalent to the Riemann hypothesis [1], which is one of the most famous and important unsolved problems in number theory. [1]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=22204576</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:22204576</guid><pubDate>Fri, 31 Jan 2020 19:12:54 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s nice to see something other than e^(ᴨi)=-1. If I had to get a math tattoo, I think I&amp;#x27;d go for lim n→∞ Q_n^(1/n) = e^(ᴨ^2/(12 log 2)). That comes from a theorem proved by Khinchin and Lévy. Khinchin proved that for almost all real numbers if you take the sequence of convergents of their continued fraction expansion, {P_1/Q_1, P_2/Q_2, ...}, then the sequence {Q_1, Q_2^(1/2), Q_3^(1/3), ...} approaches a limit, which is the same limit for almost all real numbers. Then Lévy determined the value of that limit, which is now called either Lévy&amp;#x27;s constant or the Khinchin–Lévy constant. If not…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=20393660</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:20393660</guid><pubDate>Tue, 09 Jul 2019 16:39:12 GMT</pubDate><description>&lt;p&gt;This cites a 2013 paper by Jeffry Lagarias. Lagarias also has a 2001 paper [1] with another elementary equivalent to the Riemann Hypothesis. Let s(n) be the sum of the positive integers that divide n. For example, s(6) = 1 + 2 + 3 + 6 = 12. Let H(n) = 1/1 + 1/2 + 1/3 + ... + 1/n. The Riemann Hypothesis is true if and only if s(n) &amp;lt; H(n) + exp(H(n)) log(H(n)) for all n &amp;gt; 1. [1] https://arxiv.org/abs/math/0008177&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=13346428</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:13346428</guid><pubDate>Sat, 07 Jan 2017 20:27:28 GMT</pubDate><description>&lt;p&gt;There are some interesting statements that are equivalent to the Riemann Hypothesis. What &amp;quot;equivalent&amp;quot; means is that if the statement is true then RH must be true, and if RH is true then the statement must be true. Here&amp;#x27;s one I find particularly nice. Let s(n) = the sum of the divisors of n, for a positive integer n. For example s(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28. Let H(n) = 1 + 1/2 + 1/3 + ... + 1/n. The RH is equivalent to the claim that for every integer n &amp;gt;= 1: s(n) &amp;lt;= H(n) + exp(H(n)) log(H(n)) This is due to Jeffry C. Lagarias. Here&amp;#x27;s his paper showing the equivalence…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=7730876</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:7730876</guid><pubDate>Mon, 12 May 2014 02:10:14 GMT</pubDate><description>&lt;p&gt;Speaking of the harmonic numbers, there is an interesting conjecture. Let H_n be the n&amp;#x27;th harmonic number. Let s(n) by the sum of the positive divisors of n. For example s(6) = 1 + 2 + 3 + 6. Then it is conjectured that: s(n) &amp;lt;= H_n + exp(H_n) log(H_n) with equality only in the case n = 1. What is interesting about this conjecture is that it is true if and only if the Riemann Hypotheses is true! [1] The Riemann Hypothesis is one of, if not the, most important unresolved issues in mathematics. [1] http://xxx.lanl.gov/abs/math.NT/0008177/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=6766577</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:6766577</guid><pubDate>Wed, 20 Nov 2013 06:11:09 GMT</pubDate><description>&lt;p&gt;Speaking of reformulations of the Riemann Hypothesis, there is a surprisingly elementary statement that is equivalent to the RH. Let H(1) = 1. Let H(2) = 1 + 1/2. Let H(3) = 1 + 1/2 + 1/3. ...and so on. These are called the harmonic numbers. Let S(1) = 1. Let S(2) = 1 + 2. Let S(3) = 1 + 3. Let S(4) = 1 + 2 + 4. Let S(5) = 1 + 5. Let S(6) = 1 + 2 + 3 + 6. The pattern here is harder to spot than the pattern for the harmonic numbers. S(n) for a positive integer n is the sum of the divisors of n. For instance, 6 is divisible be 1, 2, 3, and 6, so S(6) = 1 + 2 + 3 + 6. Conjecture: for any…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by archgoon</title><link>https://news.ycombinator.com/item?id=3120883</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:3120883</guid><pubDate>Mon, 17 Oct 2011 15:35:56 GMT</pubDate><description>&lt;p&gt;I believe that hyperbovine was referring to the article linked by tzs that explains the relation. http://arxiv.org/pdf/math/0008177v2&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>An Elementary Problem Equivalent to the Riemann Hypothesis — mentioned by tzs</title><link>https://news.ycombinator.com/item?id=3120010</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0008177:3120010</guid><pubDate>Mon, 17 Oct 2011 11:11:01 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s an open problem that is not hard to understand (high school math is sufficient), but whose solution would be one of the most important advances in mathematics in the last 100 years, easily: Let H_n = 1 + 1/2 + 1/3 + ... + 1/n So, H_1 = 1, H_2 = 1 + 1/2, and so on. Let divsum(n) = the sum of the divisors of n For example, divsum(10) = 1 + 2 + 5 + 10 = 18, and divsum(8) = 1 + 2 + 4 + 8 = 15. Here&amp;#x27;s the problem: Prove that for n &amp;gt; 1, divsum(n) &amp;lt; H_n + exp(H_n)*log(H_n) It turns out that this is equivalent to the Riemann hypothesis. Their equivalence is shown here…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0008177/"&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>
