Abstract
The year 1987 was the centenary of Ramanujan’s birth. He died in 1920 Had he not died so young, his presence in modern mathematics might be more immediately felt. Had he lived to have access to powerful algebraic manipulation software. such as MACSYMA, who knows how much more spectacular his already astonishing career might have been.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abramowitz and I. Stegun, Handbook of Mathematical Functions, Dover, New York, 1964.
D. H. Bailey, The Computation of π to 29,360.000 decimal digits using Borweins’ quartically convergent algorithm, Math. Comput., 50 (1988) 283–96.
D. H. Bailey, Numerical results on the transcendence of constants involving π. e. and Euler s constant. Math. Comput., 50 (1988) 275–81.
A. Baker, Transcendental Number Theory Cambridge Univ. Press, London, 1975.
P. Beckmann, A History of Pi, 4th ed., Golem Press, Boulder, CO. 1977.
R. Bellman, A Brief Introduction to Theta Functions, Holt, Reinhart and Winston, New York. 1961.
B. C. Berndt, Modular Equations of Degrees 3. 5, and 7 and Associated Theta Functions Identities, chapter 19 of Ramanujan’s Second Notebook. Springer—to be published.
A. Borodin and I. Munro, The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York, 1975.
J. M. Borwein and P. B. Borwein, The arithmetic-geometric mean and fast computation of elementary functions, SIAM Rev., 26 (1984), 351–365.
J. M. Borwein and P. B. Borwein, An explicit cubic iteration for pi, BIT, 26 (1986) 123–126.
J. M. Borwein and P. B. Borwein, Pi and the AGM—A Study in Analytic Number Theory and Computational Complexity, Wiley, N.Y., 1987.
R. P. Brent, Fast multiple-precision evaluation of elementary functions, J. ACM, 23 (1976) 242–251.
E. O. Brigham, The Fast Fourier Transform, Prentice-Hall, Englewood Cliffs. N.J., 1974.
A. Cayley, An Elementary Treatise on Elliptic Functions, Bell and Sons, 1885; reprint Dover, 1961.
A. Cayley, A memoir on the transformation of elliptic functions, Phil. Trans. T., 164 (1874) 397–456.
D. V. Chudnovsky and G. V. Chudnovsky, Padé and Rational Approximation to Systems of Functions and Their Arithmetic Applications, Lecture Notes in Mathematics 1052, Springer, Berlin, 1984.
H. R. P. Ferguson and R. W. Forcade, Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two, Bull. AMS, 1 (1979) 912–914.
C. F. Gauss, Werke, Göttingen 1866–1933, Bd 3. pp. 361–403.
G. H. Hardy, Ramanujan, Cambridge Univ. Press, London, 1940.
L. V. King, On The Direct Numerical Calculation of Elliptic Functions and Integrals, Cambridge Univ. Press, 1924.
F. Klein, Development of Mathematics in the 19th Century, 1928, Trans Math Sci. Press, R. Hermann ed., Brookline. MA, 1979.
D. Knuth, The Art of Computer Programming. vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981.
F. Lindemann, Über die Zahl π, Math. Ann.. 20 (1882) 213–225.
G. Miel, On calculations past and present: the Archimedean algorithm. Amer. Math. Monthly. 90 (1983) 17–35.
D. J. Newman, Rational Approximation Versus Fast Computer Methods, in Lectures on Approximation and Value Distribution, Presses de l’Université de Montreal, 1982, pp. 149–174.
S. Ramanujan, Modular equations and approximations to π, Quart. J. Math. 45 (1914) 350–72.
E. Salamin, Computation of it using arithmetic-geometric mean, Math. Comput., 30 (1976) 565–570.
B. Schoenberg, Elliptic Modular Functions. Springer, Berlin. 1976.
A. Schönhage and V. Strassen, Schnelle Multiplikation Grosser Zahlen, Computing, 7 (1971) 281–292.
D. Shanks, Dihedral quartic approximations and series for π, J. Number Theory. 14 (1982) 397–423.
D. Shanks and J. W. Wrench, Calculation of it to 100,000 decimals, Math Comput., 16 (1962) 76–79.
W. Shanks, Contributions to Mathematics Comprising Chiefly of the Rectification of the Circle to 607 Places of Decimals, G. Bell, London, 1853.
Y. Tamura and Y. Kanada. Calculation of it to 4.196.393 decimals based on Gauss-Legendre algorithm, preprint (1983).
J. Tannery and J. Molk, Fonctions Elliptiques, vols. 1 and 2, 1893; reprint Chelsea, New York, 1972.
S. Wagon, Is TT normal?, The Math Intelligencer, 7 (1985) 65–67.
G. N. Watson, Some singular moduli (1), Quart. J. Math., 3 (1932) 81–98.
The final problem: an account of the mock theta functions, J. London Math. Soc.,11 (1936) 55–80.
H. Weber, Lehrbuch der Algebra, Vol. 3, 1908; reprint Chelsea. New York, 1980.
E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, 4th ed, Cambridge Univ. Press, London, 1927.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Borwein, J.M., Borwein, P.B., Bailey, D.H. (1997). Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi. In: Pi: A Source Book. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2736-4_64
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2736-4_64
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-2738-8
Online ISBN: 978-1-4757-2736-4
eBook Packages: Springer Book Archive