Chudnovsky algorithm
Summary
The Chudnovsky algorithm computes the digits of pi by summing a fast-converging series for found by David and Gregory Chudnovsky. Each term of the series adds about fourteen correct decimal digits. Evaluated with binary splitting and fast multiplication, it has been used for many record computations of . It belongs to the same family as Ramanujan's series for 1/pi.
Further reading
About this page
| Tag | JKCKXDT5B5 |
|---|---|
| URI | m2://JKCKXDT5B5 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 11Y60, 65D20 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.