Search results
Results from the WOW.Com Content Network
The first to use an electronic computer (the ENIAC) to calculate π [25] 70 hours 2,037: 1953: Kurt Mahler: Showed that π is not a Liouville number: 1954 S. C. Nicholson & J. Jeenel Using the NORC [26] 13 minutes 3,093: 1957 George E. Felton: Ferranti Pegasus computer (London), calculated 10,021 digits, but not all were correct [27] [28] 33 ...
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.
Zhao's method involved finding the perimeter of a 16384-sided polygon. A 2048-sided polygon would have sufficiently proved pi is near 355/113, however it is believed he was trying to prove that it was within Zu Chongzhi’s interval, thus the need for 16384 sides. [1] Zhao also claimed that the value of pi could never be exhaustively calculated ...
calculating one year as 365.24281481 days, which is very close to 365.24219878 days as we know today. calculating the number of overlaps between sun and moon as 27.21223, which is very close to 27.21222 as we know today; using this number he successfully predicted an eclipse four times during 23 years (from 436 to 459).
Google engineer Emma Haruka Iwao has calculated pi to 31 trillion digits, breaking the world record.
The best known approximations to π dating to before the Common Era were accurate to two decimal places; this was improved upon in Chinese mathematics in particular by the mid-first millennium, to an accuracy of seven decimal places.
where C is the circumference of a circle, d is the diameter, and r is the radius.More generally, = where L and w are, respectively, the perimeter and the width of any curve of constant width.
From 2002 until 2009, Kanada held the world record calculating the number of digits in the decimal expansion of pi – exactly 1.2411 trillion digits. [1] The calculation took more than 600 hours on 64 nodes of a HITACHI SR8000/MPP supercomputer. Some of his competitors in recent years include Jonathan and Peter Borwein and the Chudnovsky brothers.