A walkthrough of computing π using the Chudnovsky algorithm in C with the GNU MultiPrecision (GMP) library. Covers the history of π computation, how infinite series converge to π, why standard floating-point precision falls short, and how GMP enables arbitrary-precision arithmetic. Includes annotated C code implementing the Chudnovsky summation loop, a brief explanation of bits-per-decimal-digit conversion, and notes on parallelizing the computation with OpenMP.
Table of contents
First, a bit of historyEstimation with Infinite SeriesGetting Precise with GMPChudnovsky, we meet at lastFaster!LinksSort: