enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Bailey–Borwein–Plouffe formula - Wikipedia

    en.wikipedia.org/wiki/Bailey–Borwein–Plouffe...

    This does not compute the nth decimal digit of π (i.e., in base 10). [3] But another formula discovered by Plouffe in 2022 allows extracting the nth digit of π in decimal. [4] BBP and BBP-inspired algorithms have been used in projects such as PiHex [5] for calculating many digits of π using distributed computing. The existence of this ...

  3. Chudnovsky algorithm - Wikipedia

    en.wikipedia.org/wiki/Chudnovsky_algorithm

    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.

  4. Category:Pi algorithms - Wikipedia

    en.wikipedia.org/wiki/Category:Pi_algorithms

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us

  5. Chronology of computation of π - Wikipedia

    en.wikipedia.org/wiki/Chronology_of_computation...

    Finds a formula that allows the nth hexadecimal digit of pi to be calculated without calculating the preceding digits. 28 August 1995 Yasumasa Kanada and Daisuke Takahashi: HITAC S-3800/480 (dual CPU) [36] [37] 56.74 hours? 4,294,960,000: 11 October 1995 Yasumasa Kanada and Daisuke Takahashi: HITAC S-3800/480 (dual CPU) [38] [37] 116.63 hours ...

  6. PiHex - Wikipedia

    en.wikipedia.org/wiki/PiHex

    PiHex was a distributed computing project organized by Colin Percival to calculate specific bits of π. [1] 1,246 contributors [2] used idle time slices on almost two thousand computers [citation needed] to make its calculations.

  7. Non-integer base of numeration - Wikipedia

    en.wikipedia.org/wiki/Non-integer_base_of_numeration

    digit = floor ((n / b ^ i) mod b) n-= digit * b ^ i result += digit} return result} Note that the above code is only valid for 1 < β ≤ 10 {\displaystyle 1<\beta \leq 10} and n ≥ 0 {\displaystyle n\geq 0} , as it does not convert each digits to their correct symbols or correct negative numbers.

  8. List of topics related to π - Wikipedia

    en.wikipedia.org/wiki/List_of_topics_related_to_π

    A History of Pi (book) Indiana Pi Bill; Leibniz formula for pi; Lindemann–Weierstrass theorem (Proof that π is transcendental) List of circle topics; List of formulae involving π; Liu Hui's π algorithm; Mathematical constant (sorted by continued fraction representation) Mathematical constants and functions; Method of exhaustion; Milü; Pi ...

  9. Liu Hui's π algorithm - Wikipedia

    en.wikipedia.org/wiki/Liu_Hui's_π_algorithm

    Liu Hui's method of calculating the area of a circle. Liu Hui's π algorithm was invented by Liu Hui (fl. 3rd century), a mathematician of the state of Cao Wei.Before his time, the ratio of the circumference of a circle to its diameter was often taken experimentally as three in China, while Zhang Heng (78–139) rendered it as 3.1724 (from the proportion of the celestial circle to the diameter ...