Computing Pi the Chudnovsky Way

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

The Chudnovsky algorithm generates 14 or more digits of for every summation step. It has been used to achieve numerous world record calculations for since it was published in 1989. As implemented here, Mathematica calculates an approximation to for a number of summation steps that you set. The Demonstration shows how many total digits of have been correctly computed as a result.

Contributed by: Michael Stern (January 2014)
Open content licensed under CC BY-NC-SA


Snapshots


Details

References

[1] D. Chudnovsky and G. Chudnovsky, "The Computation of Classical Constants," Proceedings of the National Academy of Sciences (PNAS89), Washington, DC, 1989. www.pnas.org/content/86/21/8178.full.pdf.

[2] Wikipedia. "Chudnovsky Algorithm." (Oct 22, 2013) en.wikipedia.org/wiki/Chudnovsky_algorithm.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send