A BBP-style computation for $\pi$ in base 5
Wadim Zudilin
TL;DR
This paper discusses a novel BBP-style algorithm for efficiently computing individual digits of pi in base 5 without calculating all previous digits, highlighting a new approach to digit extraction.
Contribution
Introduces a BBP-style method tailored for base 5 to compute pi digits directly, advancing digit extraction techniques.
Findings
Efficient direct computation of pi digits in base 5.
New algorithm reduces computational complexity for digit extraction.
Potential applications in high-precision calculations and cryptography.
Abstract
We joke about how to compute (promptly) the digits of , in base 5, from a given place without computing preceding ones.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Coding theory and cryptography · Handwritten Text Recognition Techniques