<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A formula for the $n^{\rm th}$ decimal digit or binary of $π$ and powers of $π$ · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2201.12601/</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/2201.12601/feed.xml" rel="self" type="application/rss+xml" /><item><title>A formula for the $n^{\rm th}$ decimal digit or binary of $π$ and powers of $π$ — HN submission</title><link>https://news.ycombinator.com/item?id=34389145</link><guid isPermaLink="false">urn:hackerpapers:submission:2201.12601:34389145</guid><pubDate>Sun, 15 Jan 2023 13:12:38 GMT</pubDate><description>&lt;p&gt;A formula for the nth digit of 𝜋 and 𝜋^n&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;268 points; 133 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2201.12601/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.NT</category></item><item><title>A formula for the $n^{\rm th}$ decimal digit or binary of $π$ and powers of $π$ — mentioned by schoen</title><link>https://news.ycombinator.com/item?id=31536907</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.12601:31536907</guid><pubDate>Sat, 28 May 2022 01:51:38 GMT</pubDate><description>&lt;p&gt;I was very surprised to learn that Plouffe has actually also devised a formula that gives the nth decimal digit! It looks like this was a much more recent discovery. https://mathworld.wolfram.com/Digit-ExtractionAlgorithm.html https://arxiv.org/abs/2201.12601 I first wrote that I thought this was asymptotically much faster than computing the intermediate digits, but somewhat slow because it requires computing Bernoulli numbers as one input. But in Plouffe&amp;#x27;s PDF, he says that actually the convergence is very slow and you would do significantly better computing the intermediate digits with…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.12601/"&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>
