19 ms·

So we've already had the Bailey–Borwein–Plouffe (BBP) formula for computing an arbitrary digit of pi in base 16, which by itself is mind blowing, but I just fou

So we've already had the Bailey–Borwein–Plouffe (BBP) formula for computing an arbitrary digit of pi in base 16, which by itself is mind blowing, but I just found out that Plouffe has come up with a new version for base 10. https://mathworld.wolfram.com/Digit-ExtractionAlgorithm.html https://mathworld.wolfram.com/Digit-ExtractionAlgorithm.html

deleted 4y ago
[deleted]
aquafox 4y ago
But the base 10 formula needs Bernoulli numbers, which themselves are defined recursively, meaning the required iterations are just hidden and not removed.