|
Y-cruncher
The Chudnovsky algorithm is a fast method for calculating the digits of , based on Ramanujan’s formulae. It was published by the Chudnovsky brothers in 1988. It was used in the world record calculations of 2.7 trillion digits of in December 2009, 10 trillion digits in October 2011, 22.4 trillion digits in November 2016, 31.4 trillion digits in September 2018–January 2019, 50 trillion digits on January 29, 2020, 62.8 trillion digits on August 14, 2021, and 100 trillion digits on March 21, 2022. Algorithm The algorithm is based on the negated Heegner number d = -163 , the ''j''-function j \left(\tfrac\right) = -640320^3, and on the following rapidly convergent generalized hypergeometric series: : \frac = 12 \sum^\infty_ \frac A detailed proof of this formula can be found here: For a high performance iterative implementation, this can be simplified to : \frac=\frac = \sum^\infty_ \frac There are 3 big integer terms (the multinomial term ''Mq'', the linear term ''Lq'', ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Approximations Of π
Approximations for the mathematical constant pi () in the history of mathematics reached an accuracy within 0.04% of the true value before the beginning of the Common Era. In Chinese mathematics, this was improved to approximations correct to what corresponds to about seven decimal digits by the 5th century. Further progress was not made until the 15th century (through the efforts of Jamshīd al-Kāshī). Early modern mathematicians reached an accuracy of 35 digits by the beginning of the 17th century (Ludolph van Ceulen), and 126 digits by the 19th century (Jurij Vega), surpassing the accuracy required for any conceivable application outside of pure mathematics. The record of manual approximation of is held by William Shanks, who calculated 527 digits correctly in 1853. Since the middle of the 20th century, the approximation of has been the task of electronic digital computers (for a comprehensive account, see Chronology of computation of ). On June 8, 2022, the current r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Formulae Involving π
The following is a list of significant formulae involving the mathematical constant . Many of these formulae can be found in the article Pi, or the article Approximations of . Euclidean geometry :\pi = \frac Cd where is the circumference of a circle, is the diameter. More generally, :\pi=\frac where and are, respectively, the perimeter and the width of any curve of constant width. :A = \pi r^2 where is the area of a circle and is the radius. More generally, :A = \pi ab where is the area enclosed by an ellipse with semi-major axis and semi-minor axis . :A=4\pi r^2 where is the area between the witch of Agnesi and its asymptotic line; is the radius of the defining circle. :A=\frac r^2=\frac where is the area of a squircle with minor radius , \Gamma is the gamma function and \operatorname is the arithmetic–geometric mean. :A=(k+1)(k+2)\pi r^2 where is the area of an epicycloid with the smaller circle of radius and the larger circle of radius (k\in\mathbb), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chudnovsky Brothers
David Volfovich Chudnovsky (born January 22, 1947 in Kyiv) and Gregory Volfovich Chudnovsky (born April 17, 1952 in Kyiv) are Ukrainian-born American mathematicians and engineers known for their world-record mathematical calculations and developing the Chudnovsky algorithm used to calculate the digits of with extreme precision. Careers in mathematics As a child, Gregory Chudnovsky was given a copy of '' What Is Mathematics?'' by his father (Volf Grigorovich Chudnovski, a Soviet-Ukrainian professor of technical sciences) and decided that he wanted to be a mathematician. As a high schooler, he solved Hilbert's tenth problem, shortly after Yuri Matiyasevich had solved it. He received a mathematics degree from Kyiv State University in 1974 and a PhD the following year from the Institute of Mathematics, National Academy of Sciences of Ukraine. In part to avoid religious persecution and in part to seek better medical care for Gregory, who had been diagnosed with myasthenia gravis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chronology Of Computation Of π
The table below is a brief chronology of computed numerical values of, or bounds on, the mathematical constant pi (). For more detailed explanations for some of these calculations, see Approximations of . The last 100 decimal digits of the latest 2022 world record computation are: 4658718895 1242883556 4671544483 9873493812 1206904813 2656719174 5255431487 2142102057 7077336434 3095295560 Before 1400 1400–1949 1949–2009 2009–present See also * History of pi *Approximations of π Approximations for the mathematical constant pi () in the history of mathematics reached an accuracy within 0.04% of the true value before the beginning of the Common Era. In Chinese mathematics, this was improved to approximations correct to ... References External links * Borwein, Jonathan,The Life of Pi {{DEFAULTSORT:Chronology Of Computation Of Pi Pi History of mathematics Pi Pi algorithms ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
New Scientist
''New Scientist'' is a magazine covering all aspects of science and technology. Based in London, it publishes weekly English-language editions in the United Kingdom, the United States and Australia. An editorially separate organisation publishes a monthly Dutch-language edition. First published on 22 November 1956, ''New Scientist'' has been available in online form since 1996. Sold in retail outlets (paper edition) and on subscription (paper and/or online), the magazine covers news, features, reviews and commentary on science, technology and their implications. ''New Scientist'' also publishes speculative articles, ranging from the technical to the philosophical. ''New Scientist'' was acquired by Daily Mail and General Trust (DMGT) in March 2021. History Ownership The magazine was founded in 1956 by Tom Margerison, Max Raison and Nicholas Harrison as ''The New Scientist'', with Issue 1 on 22 November 1956, priced at one shilling (a twentieth of a pound in pre-decimal UK cu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heegner Number
In number theory, a Heegner number (as termed by Conway and Guy) is a square-free positive integer ''d'' such that the imaginary quadratic field \Q\left sqrt\right/math> has class number 1. Equivalently, its ring of integers has unique factorization. The determination of such numbers is a special case of the class number problem, and they underlie several striking results in number theory. According to the (Baker–) Stark–Heegner theorem there are precisely nine Heegner numbers: This result was conjectured by Gauss and proved up to minor flaws by Kurt Heegner in 1952. Alan Baker and Harold Stark independently proved the result in 1966, and Stark further indicated the gap in Heegner's proof was minor. Euler's prime-generating polynomial Euler's prime-generating polynomial n^2 + n + 41, which gives (distinct) primes for ''n'' = 0, ..., 39, is related to the Heegner number 163 = 4 · 41 − 1. Rabinowitz proved that n^2 + n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
J-invariant
In mathematics, Felix Klein's -invariant or function, regarded as a function of a Complex analysis, complex variable , is a modular function of weight zero for defined on the upper half-plane of complex numbers. It is the unique such function which is Holomorphic function, holomorphic away from a simple pole at the Cusp (singularity), cusp such that :j\left(e^\right) = 0, \quad j(i) = 1728 = 12^3. Rational functions of are modular, and in fact give all modular functions. Classically, the -invariant was studied as a parameterization of elliptic curves over , but it also has surprising connections to the symmetries of the Monster group (this connection is referred to as monstrous moonshine). Definition The -invariant can be defined as a function on the upper half-plane :j(\tau) = 1728 \frac = 1728 \frac = 1728 \frac with the third definition implying j(\tau) can be expressed as a Cube (algebra), cube, also since 1728 (number), 1728 = 12^3. The given functions are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generalized Hypergeometric Series
In mathematics, a generalized hypergeometric series is a power series in which the ratio of successive coefficients indexed by ''n'' is a rational function of ''n''. The series, if convergent, defines a generalized hypergeometric function, which may then be defined over a wider domain of the argument by analytic continuation. The generalized hypergeometric series is sometimes just called the hypergeometric series, though this term also sometimes just refers to the Gaussian hypergeometric series. Generalized hypergeometric functions include the (Gaussian) hypergeometric function and the confluent hypergeometric function as special cases, which in turn have many particular special functions as special cases, such as elementary functions, Bessel functions, and the classical orthogonal polynomials. Notation A hypergeometric series is formally defined as a power series :\beta_0 + \beta_1 z + \beta_2 z^2 + \dots = \sum_ \beta_n z^n in which the ratio of successive coefficients is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ramanujan–Sato Series
In mathematics, a Ramanujan–Sato series generalizes Ramanujan’s pi formulas such as, :\frac = \frac \sum_^\infty \frac \frac to the form :\frac = \sum_^\infty s(k) \frac by using other well-defined sequences of integers s(k) obeying a certain recurrence relation, sequences which may be expressed in terms of binomial coefficients \tbinom, and A,B,C employing modular forms of higher levels. Ramanujan made the enigmatic remark that there were "corresponding theories", but it was only recently that H. H. Chan and S. Cooper found a general approach that used the underlying modular congruence subgroup \Gamma_0(n), while G. Almkvist has experimentally found numerous other examples also with a general method using differential operators. Levels ''1–4A'' were given by Ramanujan (1914), level ''5'' by H. H. Chan and S. Cooper (2012), ''6A'' by Chan, Tanigawa, Yang, and Zudilin, ''6B'' by Sato (2002), ''6C'' by H. Chan, S. Chan, and Z. Liu (2004), ''6D'' by H. Chan and H. Verr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Time Complexity
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is generally expresse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Borwein's Algorithm
In mathematics, Borwein's algorithm is an algorithm devised by Jonathan Borwein, Jonathan and Peter Borwein to calculate the value of . They devised several other algorithms. They published the book ''Pi and the AGM – A Study in Analytic Number Theory and Computational Complexity''. Ramanujan–Sato series These two are examples of a Ramanujan–Sato series. The related Chudnovsky algorithm uses a discriminant with class number 1. Class number 2 (1989) Start by setting : \begin A & = 212175710912 \sqrt + 1657145277365 \\ B & = 13773980892672 \sqrt + 107578229802750 \\ C & = \left(5280\left(236674+30303\sqrt\right)\right)^3 \end Then :\frac = 12\sum_^\infty \frac Each additional term of the partial sum yields approximately 25 digits. Class number 4 (1993) Start by setting : \begin A = & 63365028312971999585426220 \\ & + 28337702140800842046825600\sqrt \\ & + 384\sqrt \big(108917285511711782004674362123952091 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
