zbMATH — the first resource for mathematics

Is \(\pi\) normal ? (English) Zbl 0565.10002
This is a brief report on several computational techniques for computing digits of \(\pi\). A statistical analysis of the first ten millions digits does not show an unusual deviation from normality.
Reviewer: F.Schweiger

11-04 Software, source code, etc. for problems pertaining to number theory
11A63 Radix representation; digital problems
11K16 Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc.
Full Text: DOI
[1] J. M. Borwein and P. B. Borwein, The arithmetic-geometric mean and fast computation of elementary functions,SIAM Review 26, (1984) 351–366. · Zbl 0557.65009
[2] R. P. Brent, Multiple-precision zero-findings methods and the complexity of elementary function evaluation, inAnalytic Computational Complexity, J. F. Traub, ed., New York: Academic Press, 1976, pp. 151–176.
[3] D. Cox, The arithmetic-geometric mean of Gauss,Ens. Math. 30, (1984) 275–330. · Zbl 0583.33002
[4] G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers, 4th edition, London: Oxford, 1975. · Zbl 0020.29201
[5] Y. Kanada, Y. Tamura, S. Yoshino, and Y. Ushiro, Calculation of {\(\pi\)} to 10,013,395 decimal places based on the Gauss-Legendre algorithm and Gauss arctangent relations,Mathematics of Computation (forthcoming).
[6] D.E. Knuth,The Art of Computer Programming, vol. 2, Reading, Mass.: Addison-Wesley, 1969. · Zbl 0191.18001
[7] I. Niven,Irrational Numbers, Carus Mathematical Monographs, No. 11, The Mathematical Association of America. Distributed by Wiley, New York, 1967.
[8] E. Salamin, Computation of {\(\pi\)} using arithmetic-geometric mean,Mathematics of Computation 30, (1976) 565–570. · Zbl 0345.10003
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.