The Chudnovsky algorithm is a fast method for calculating the digits of π, based on Ramanujan's π formulae. Published by the Chudnovsky brothers in 1988,[1] it was used to calculate π to a billion decimal places.[2]
It was used in the world record calculations of 2.7 trillion digits of π in December 2009,[3] 10 trillion digits in October 2011,[4][5] 22.4 trillion digits in November 2016,[6] 31.4 trillion digits in September 2018–January 2019,[7] 50 trillion digits on January 29, 2020,[8] 62.8 trillion digits on August 14, 2021,[9] 100 trillion digits on March 21, 2022,[10] and 105 trillion digits on March 14, 2024.[11]
^Chudnovsky, David; Chudnovsky, Gregory (1988), Approximation and complex multiplication according to Ramanujan, Ramanujan revisited: proceedings of the centenary conference
^Warsi, Karl; Dangerfield, Jan; Farndon, John; Griffiths, Johny; Jackson, Tom; Patel, Mukul; Pope, Sue; Parker, Matt (2019). The Math Book: Big Ideas Simply Explained. New York: Dorling Kindersley Limited. p. 65. ISBN 978-1-4654-8024-8.
^
Baruah, Nayandeep Deka; Berndt, Bruce C.; Chan, Heng Huat (2009-08-01). "Ramanujan's Series for 1/π: A Survey". American Mathematical Monthly. 116 (7): 567–587. doi:10.4169/193009709X458555.
^Yee, Alexander; Kondo, Shigeru (2011), 10 Trillion Digits of Pi: A Case Study of summing Hypergeometric Series to high precision on Multicore Systems, Technical Report, Computer Science Department, University of Illinois, hdl:2142/28348
^Aron, Jacob (March 14, 2012), "Constants clash on pi day", New Scientist
^"22.4 Trillion Digits of Pi". www.numberworld.org.
^"Google Cloud Topples the Pi Record". www.numberworld.org/.
^"The Pi Record Returns to the Personal Computer". www.numberworld.org/.
The Chudnovskyalgorithm is a fast method for calculating the digits of π, based on Ramanujan's π formulae. Published by the Chudnovsky brothers in 1988...
mathematicians Chudnovskyalgorithm is a fast method for calculating the digits of π David Chudnovsky (politician) in Canada Maria Chudnovsky, mathematician...
π: Borwein's algorithm: an algorithm to calculate the value of 1/π Gauss–Legendre algorithm: computes the digits of pi Chudnovskyalgorithm: a fast method...
anticipated the modern algorithms developed by the Borwein brothers (Jonathan and Peter) and the Chudnovsky brothers. The Chudnovsky formula developed in...
iteration which converges quartically to 1/π, and other algorithmsChudnovskyalgorithm — fast algorithm that calculates a hypergeometric series Bailey–Borwein–Plouffe...
complements. Other research contributions of Chudnovsky include co-authorship of the first polynomial-time algorithm for recognizing perfect graphs (time bounded...
perfect graph theorem by Chudnovsky, Robertson, Seymour, and Thomas in 2002. Graph coloring has been studied as an algorithmic problem since the early...
generalization of the four color theorem, which arises at d=3. Maria Chudnovsky, Katherine Edwards, and Paul Seymour proved that an 8-regular planar multigraph...
conquer algorithm that always divides the problem in two halves. Xavier Gourdon & Pascal Sebah. Binary splitting method David V. Chudnovsky & Gregory...
(3rd ed.), Springer, ISBN 3-540-26182-6. Electronic edition, page 4. Chudnovsky, Maria; Seymour, Paul (2005), "The structure of claw-free graphs" (PDF)...
perfect graph theorem was proved, Chudnovsky, Cornuéjols, Liu, Seymour, and Vušković discovered a polynomial time algorithm for testing the existence of odd...
to independent papers by L. C. Chang (1959) and A. J. Hoffman (1960). Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong...
Texts in Mathematics, vol. 184, Springer, p. 165, ISBN 9780387984889. Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong...
graphs, and a polynomial time recognition algorithm for Bull-free perfect graphs is known. Maria Chudnovsky and Shmuel Safra have studied bull-free graphs...
Global Information