Chudnovsky algorithm
From Wikipedia, the free encyclopedia
The Chudnovsky algorithm is a fast method for calculating the digits of π. It was used by the Chudnovsky brothers to calculate more than one billion digits. It was used in the world record calculations of 2.7 trillion digits of π in December 2009, and 5 trillion digits of π in August 2010.
The algorithm is based on the following rapidly convergent generalized hypergeometric series:
This identity is similar to some of Ramanujan's formulae involving π.
[edit] See also
[edit] References
- Chudnovsky, David V.; Chudnovsky, Gregory V. (1989), "The Computation of Classical Constants", Proceedings of the National Academy of Sciences of the United States of America 86 (21): 8178–8182, doi:10.1073/pnas.86.21.8178, ISSN 0027-8424, JSTOR 34831, PMC 298242, PMID 16594075
| This number article is a stub. You can help Wikipedia by expanding it. |
