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.
The algorithm is based on the following rapidly convergent hypergeometric series:
This identity is very 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, ISSN 0027-8424, <http://www.jstor.org/stable/34831>.
 |
This number article is a stub. You can help by expanding it. |
