The quest for pi (Q1361163): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56001144, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rapid computation of various polylogarithmic constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3157849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Precision Evaluation of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spigot Algorithm for the Digits of &#960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of π Using Arithmetic-Geometric Mean / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of π to 100,000 Decimals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is \(\pi\) normal ? / rank
 
Normal rank

Latest revision as of 17:38, 27 May 2024

scientific article
Language Label Description Also known as
English
The quest for pi
scientific article

    Statements

    The quest for pi (English)
    0 references
    0 references
    17 December 1997
    0 references
    This article gives a brief history of the computation of the mathematical constant \(\pi=3.14159 \dots \) with emphasis on the most recent developments. Various approximations were known to the ancients. In the Bible the value 3 occurs. Archimedes presented the first rigorous mathematical method for the calculation of \(\pi\). After the discovery of the calculus by Newton and Leibniz many formulas for \(\pi\) were derived from the power series for the inverse trigonometric functions. The development of computers after the war increased the computing power. At the same time several new and unexpected new formulas connected with \(\pi\) were discovered. First progress was made with Ramanujan's fast converging series. A second improvement was the quadratically convergent algorithm of Salamin and Brent (1976) based on the arithmetic-geometric mean. With related methods Kanada calculated in 1995 over 6 billion decimal digits of \(\pi\). These methods still require high precision arithmetic. The spigot algorithm of Rabinowitz and Wagon calculates successive digits from previous digits recursively without the need of multiply precision computation software. Recently, a new algorithm has been discovered for computing individual hexadecimal digits of \(\pi\) without the need of calculation any previous digits. By the way, the 100-billion'th hexadecimal digit of \(\pi\) is 9. The headline of the final section is ``Why?''. There are some applications: Test computer hardware, advance computational techniques and theoretical questions, such as the equidistribution of digits. But the most fundamental motivation for computing \(\pi\) is: ``Because it is there''.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pi
    0 references
    brief history of the computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references