Pi: Difficult or Easy?

DOI10.1080/0025570X.1987.11977289MaRDI QIDQ3763468zbMATH OpenOpenAlexFDO

Authors G. A. Edgar

Publication date 1987

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0025570x.1987.11977289

zbMATH Keywords

computational complexitymulti-digit computationno convergence accelerationnumber enumber pipower series summation

Mathematics Subject Classification ID

Numerical summation of series (65B10) Computation of special functions and constants, construction of tables (65D20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Birth, growth and computation of pi to ten trillion digits
• scientific article; zbMATH DE number 176881
• The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
• scientific article; zbMATH DE number 1372548
• The life of : from Archimedes to ENIAC and beyond

Cited in

(10)

• Birth, growth and computation of pi to ten trillion digits
• , e, with MATLAB. Random and rational sequences with scope in supercomputing era
• scientific article; zbMATH DE number 3862330 (Why is no real title available?)
• scientific article; zbMATH DE number 19073 (Why is no real title available?)
• Visible Structures in Number Theory
• Exact Kronecker constants of Hadamard sets
• The life of : from Archimedes to ENIAC and beyond
• Pi -- the value and its origin
• Large-Scale Scientific Computing
• Variable-precision arithmetic considered perilous - a detective story

This page was built for publication: Pi: Difficult or Easy?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763468)