Mathematical Constants - Refkolrefkol.ro/matek/mathbooks/ro.math.wikia.com wiki...61 H. Groemer...

P1: IKB

CB503-FM CB503/Finch-v2.cls December 9, 2004 18:34 Char Count=

Mathematical Constants

Famous mathematical constants include the ratio of circular circumference to diameter,π = 3.14 . . . , and the natural logarithmic base, e = 2.178 . . . . Students and professionalsusually can name at most a few others, but there are many more buried in the literature andawaiting discovery.

How do such constants arise, and why are they important? Here Steven Finch provides136 essays, each devoted to a mathematical constant or a class of constants, from the wellknown to the highly exotic. Topics covered include the statistics of continued fractions,chaos in nonlinear systems, prime numbers, sum-free sets, isoperimetric problems, approxi-mation theory, self-avoiding walks and the Ising model (from statistical physics), binary anddigital search trees (from theoretical computer science), the Prouhet–Thue–Morse sequence,complex analysis, geometric probability, and the traveling salesman problem. This bookwill be helpful both to readers seeking information about a specific constant and to readerswho desire a panoramic view of all constants coming from a particular field, for example,combinatorial enumeration or geometric optimization. Unsolved problems appear virtuallyeverywhere as well. This is an outstanding scholarly attempt to bring together all significantmathematical constants in one place.

Steven R. Finch studied at Oberlin College and the University of Illinois in Urbana-Champaign, and held positions at TASC, MIT Lincoln Laboratory, and MathSoft Inc. Heis presently a freelance mathematician in the Boston area. He is also a composer and hasreleased a CD entitled “An Apple Gathering” devoted to his vocal and choral music.

i

P1: IKB


ii

P1: IKB


ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS

FOUNDING EDITOR GIAN-CARLO ROTAEditorial BoardR. Doran, P. Flajolet, M. Ismail, T.-Y. Lam, E. Lutwak,Volume 94

27 N. H. Bingham, C. M. Goldie, and J. L. Teugels Regular Variation29 N. White (ed.) Combinatorial Geometries30 M. Pohst and H. Zassenhaus Algorithmic Algebraic Number Theory31 J. Aczel and J. Dhombres Functional Equations in Several Variables32 M. Kuczma, B. Choczewski, and R. Ger Iterative Functional Equations33 R. V. Ambartzumian Factorization Calculus and Geometric Probability34 G. Gripenberg, S.-O. Londen, and O. Staffans Volterra Integral and Functional

Equations35 G. Gasper and M. Rahman Basic Hypergeometric Series36 E. Torgersen Comparison of Statistical Experiments38 N. Korneichuk Exact Constants in Approximation Theory39 R. Brualdi and H. Ryser Combinatorial Matrix Theory40 N. White (ed.) Matroid Applications41 S. Sakai Operator Algebras in Dynamical Systems42 W. Hodges Basic Model Theory43 H. Stahl and V. Totik General Orthogonal Polynomials45 G. Da Prato and J. Zabczyk Stochastic Equations in Infinite Dimensions46 A. Björner et al. Oriented Matroids47 G. Edgar and L. Sucheston Stopping Times and Directed Processes48 C. Sims Computation with Finitely Presented Groups49 T. Palmer Banach Algebras and the General Theory of *-Algebras I50 F. Borceux Handbook of Categorical Algebra I51 F. Borceux Handbook of Categorical Algebra II52 F. Borceux Handbook of Categorical Algebra III53 V. F. Kolchin Random Graphs54 A. Katok and B. Hasselblatt Introduction to the Modern Theory of Dynamical Systems55 V. N. Sachkov Combinatorial Methods in Discrete Mathematics56 V. N. Sachkov Probabilistic Methods in Discrete Mathematics57 P. M. Cohn Skew Fields58 R. Gardner Geometric Tomography59 G. A. Baker Jr. and P. Graves-Morris Pade Approximants, 2ed60 J. Krajicek Bounded Arithmetic, Propositional Logic and Complexity Theory61 H. Groemer Geometric Applications of Fourier Series and Spherical Harmonics62 H. O. Fattorini Infinite Dimensional Optimization and Control Theory63 A. C. Thompson Minkowski Geometry64 R. B. Bapat and T. E. S. Raghavan Nonnegative Matrices with Applications65 K. Engel Sperner Theory66 D. Cvetkovic, P. Rowlinson, and S. Simic Eigenspaces of Graphs67 F. Bergeron, G. Labelle, and P. Leroux Combinatorial Species and Tree-Like Structures68 R. Goodman and N. Wallach Representations and Invariants of the Classical Groups69 T. Beth, D. Jungnickel, and H. Lenz Design Theory I, 2ed70 A. Pietsch and J. Wenzel Orthonormal Systems for Banach Space Geometry71 G. E. Andrews, R. Askey, and R. Roy Special Functions72 R. Ticciati Quantum Field Theory for Mathematicians73 M. Stern Semimodular Lattices74 I. Lasiecka and R. Triggiani Control Theory for Partial Differential Equations I75 I. Lasiecka and R. Triggiani Control Theory for Partial Differential Equations II76 A. A. Ivanov Geometry of Sporadic Groups 177 A. Schinzel Polynomials with Special Regard to Reducibility78 H. Lenz, T. Beth, and D. Jungnickel Design Theory II, 2ed79 T. Palmer Banach Algebras and the General Theory of *-Algebras II80 O. Stormark Lie’s Structural Approach to PDE Systems81 C. F. Dunkl and Y. Xu Orthogonal Polynomials of Several Variables82 J. P. Mayberry The Foundations of Mathematics in the Theory of Sets83 C. Foias et al. Navier–Stokes Equations and Turbulence84 B. Polster and G. Steinke Geometries on Surfaces

iii

P1: IKB


85 R. B. Paris and D. Karninski Asymptotics and Mellin–Barnes Integrals86 R. McEliece The Theory of Information and Coding, 2ed87 B. Magurn Algebraic Introduction to K-Theory88 T. Mora Systems of Polynomial Equations I89 K. Bichteler Stochastic Integration with Jumps90 M. Lothaire Algebraic Combinatorics on Words91 A. A. Ivanov and S. V. Shpectorov Geometry of Sporadic Groups II92 P. McMullen and E. Schulte Abstract Regular Polytopes93 G. Gierz et al. Continuous Lattices and Domains

iv

P1: IKB


EN C Y C LO PED IA O F MATHEMATICS AND ITS APPLICATIONS

Mathematical Constants

STEVEN R. FINCH

v

P1: IKB


CAMBRIDGE UNIVERSITY PRESS

Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, São Paulo

Cambridge University Press40 West 20th Street, New York, NY 10011-4211, USA

www.cambridge.orgInformation on this title: www.cambridge.org/9780521818056

C© Steven R. Finch 2003

This book is in copyright. Subject to statutory exceptionand to the provisions of relevant collective licensing agreements,

no reproduction of any part may take place withoutthe written permission of Cambridge University Press.

First published 2003

Printed in the United States of America

A catalog record for this book is available from the British Library.

Library of Congress Cataloging in Publication Data

Finch, Steven R., 1959–

Mathematical constants / Steven R. Finch.

p. cm. – (Encyclopedia of mathematics and its applications; v. 94)

Includes bibliographical references and index.

ISBN 0-521-81805-2

I. Mathematical constants. I. Title. II. Series.

QA41 .F54 2003513 – dc21 2002074058

ISBN-13 978-0-521-81805-6 hardbackISBN-10 0-521-81805-2 hardback

Cambridge University Press has no responsibility forthe persistence or accuracy of URLs for external or

third-party Internet Web sites referred to in this bookand does not guarantee that any content on such

Web sites is, or will remain, accurate or appropriate.

vi

P1: IKB


For Nancy Armstrong, the one constant

vii

P1: IKB


viii

P1: IKB


Contents

Preface page xviiNotation xix

1 Well-Known Constants 11.1 Pythagoras’ Constant,

√2 1

1.1.1 Generalized Continued Fractions 31.1.2 Radical Denestings 4

1.2 The Golden Mean, ϕ 51.2.1 Analysis of a Radical Expansion 81.2.2 Cubic Variations of the Golden Mean 81.2.3 Generalized Continued Fractions 91.2.4 Random Fibonacci Sequences 101.2.5 Fibonacci Factorials 10

1.3 The Natural Logarithmic Base, e 121.3.1 Analysis of a Limit 141.3.2 Continued Fractions 151.3.3 The Logarithm of Two 15

1.4 Archimedes’ Constant, π 171.4.1 Infinite Series 201.4.2 Infinite Products 211.4.3 Definite Integrals 221.4.4 Continued Fractions 231.4.5 Infinite Radical 231.4.6 Elliptic Functions 241.4.7 Unexpected Appearances 24

1.5 Euler–Mascheroni Constant, γ 281.5.1 Series and Products 301.5.2 Integrals 311.5.3 Generalized Euler Constants 321.5.4 Gamma Function 33

ix

P1: IKB


x Contents

1.6 Apéry’s Constant, ζ (3) 401.6.1 Bernoulli Numbers 411.6.2 The Riemann Hypothesis 411.6.3 Series 421.6.4 Products 451.6.5 Integrals 451.6.6 Continued Fractions 461.6.7 Stirling Cycle Numbers 471.6.8 Polylogarithms 47

1.7 Catalan’s Constant, G 531.7.1 Euler Numbers 541.7.2 Series 551.7.3 Products 561.7.4 Integrals 561.7.5 Continued Fractions 571.7.6 Inverse Tangent Integral 57

1.8 Khintchine–Lévy Constants 591.8.1 Alternative Representations 611.8.2 Derived Constants 631.8.3 Complex Analog 63

1.9 Feigenbaum–Coullet–Tresser Constants 651.9.1 Generalized Feigenbaum Constants 681.9.2 Quadratic Planar Maps 691.9.3 Cvitanovic–Feigenbaum Functional Equation 691.9.4 Golden and Silver Circle Maps 71

1.10 Madelung’s Constant 761.10.1 Lattice Sums and Euler’s Constant 78

1.11 Chaitin’s Constant 81

2 Constants Associated with Number Theory 842.1 Hardy–Littlewood Constants 84

2.1.1 Primes Represented by Quadratics 872.1.2 Goldbach’s Conjecture 872.1.3 Primes Represented by Cubics 89

2.2 Meissel–Mertens Constants 942.2.1 Quadratic Residues 96

2.3 Landau–Ramanujan Constant 982.3.1 Variations 99

2.4 Artin’s Constant 1042.4.1 Relatives 1062.4.2 Correction Factors 107

2.5 Hafner–Sarnak–McCurley Constant 1102.5.1 Carefree Couples 110

P1: IKB


Contents xi

2.6 Niven’s Constant 1122.6.1 Square-Full and Cube-Full Integers 113

2.7 Euler Totient Constants 1152.8 Pell–Stevenhagen Constants 1192.9 Alladi–Grinstead Constant 1202.10 Sierpinski’s Constant 122

2.10.1 Circle and Divisor Problems 1232.11 Abundant Numbers Density Constant 1262.12 Linnik’s Constant 1272.13 Mills’ Constant 1302.14 Brun’s Constant 1332.15 Glaisher–Kinkelin Constant 135

2.15.1 Generalized Glaisher Constants 1362.15.2 Multiple Barnes Functions 1372.15.3 GUE Hypothesis 138

2.16 Stolarsky–Harborth Constant 1452.16.1 Digital Sums 1462.16.2 Ulam 1-Additive Sequences 1472.16.3 Alternating Bit Sets 148

2.17 Gauss–Kuzmin–Wirsing Constant 1512.17.1 Ruelle-Mayer Operators 1522.17.2 Asymptotic Normality 1542.17.3 Bounded Partial Denominators 154

2.18 Porter–Hensley Constants 1562.18.1 Binary Euclidean Algorithm 1582.18.2 Worst-Case Analysis 159

2.19 Vallée’s Constant 1602.19.1 Continuant Polynomials 162

2.20 Erdös’ Reciprocal Sum Constants 1632.20.1 A-Sequences 1632.20.2 B2-Sequences 1642.20.3 Nonaveraging Sequences 164

2.21 Stieltjes Constants 1662.21.1 Generalized Gamma Functions 169

2.22 Liouville–Roth Constants 1712.23 Diophantine Approximation Constants 1742.24 Self-Numbers Density Constant 1792.25 Cameron’s Sum-Free Set Constants 1802.26 Triple-Free Set Constants 1832.27 Erdös–Lebensold Constant 185

2.27.1 Finite Case 1852.27.2 Infinite Case 1862.27.3 Generalizations 187

P1: IKB


xii Contents

2.28 Erdös’ Sum–Distinct Set Constant 1882.29 Fast Matrix Multiplication Constants 1912.30 Pisot–Vijayaraghavan–Salem Constants 192

2.30.1 Powers of 3/2 Modulo One 1942.31 Freiman’s Constant 199

2.31.1 Lagrange Spectrum 1992.31.2 Markov Spectrum 1992.31.3 Markov–Hurwitz Equation 2002.31.4 Hall’s Ray 2012.31.5 L and M Compared 202

2.32 De Bruijn–Newman Constant 2032.33 Hall–Montgomery Constant 205

3 Constants Associated with Analytic Inequalities 2083.1 Shapiro–Drinfeld Constant 208

3.1.1 Djokovic’s Conjecture 2103.2 Carlson–Levin Constants 2113.3 Landau–Kolmogorov Constants 212

3.3.1 L∞(0, ∞) Case 2123.3.2 L∞(−∞, ∞) Case 2133.3.3 L2(−∞, ∞) Case 2133.3.4 L2(0, ∞) Case 214

3.4 Hilbert’s Constants 2163.5 Copson–de Bruijn Constant 2173.6 Sobolev Isoperimetric Constants 219

3.6.1 String Inequality 2203.6.2 Rod Inequality 2203.6.3 Membrane Inequality 2213.6.4 Plate Inequality 2223.6.5 Other Variations 222

3.7 Korn Constants 2253.8 Whitney–Mikhlin Extension Constants 2273.9 Zolotarev–Schur Constant 229

3.9.1 Sewell’s Problem on an Ellipse 2303.10 Kneser–Mahler Polynomial Constants 2313.11 Grothendieck’s Constants 2353.12 Du Bois Reymond’s Constants 2373.13 Steinitz Constants 240

3.13.1 Motivation 2403.13.2 Definitions 2403.13.3 Results 241

3.14 Young–Fejér–Jackson Constants 2423.14.1 Nonnegativity of Cosine Sums 242

P1: IKB


Contents xiii

3.14.2 Positivity of Sine Sums 2433.14.3 Uniform Boundedness 243

3.15 Van der Corput’s Constant 2453.16 Turán’s Power Sum Constants 246

4 Constants Associated with the Approximation of Functions 2484.1 Gibbs–Wilbraham Constant 2484.2 Lebesgue Constants 250

4.2.1 Trigonometric Fourier Series 2504.2.2 Lagrange Interpolation 252

4.3 Achieser–Krein–Favard Constants 2554.4 Bernstein’s Constant 2574.5 The “One-Ninth” Constant 2594.6 Fransén–Robinson Constant 2624.7 Berry–Esseen Constant 2644.8 Laplace Limit Constant 2664.9 Integer Chebyshev Constant 268

4.9.1 Transfinite Diameter 271

5 Constants Associated with EnumeratingDiscrete Structures 2735.1 Abelian Group Enumeration Constants 274

5.1.1 Semisimple Associative Rings 2775.2 Pythagorean Triple Constants 2785.3 Rényi’s Parking Constant 278

5.3.1 Random Sequential Adsorption 2805.4 Golomb–Dickman Constant 284

5.4.1 Symmetric Group 2875.4.2 Random Mapping Statistics 287

5.5 Kalmár’s Composition Constant 2925.6 Otter’s Tree Enumeration Constants 295

5.6.1 Chemical Isomers 2985.6.2 More Tree Varieties 3015.6.3 Attributes 3035.6.4 Forests 3055.6.5 Cacti and 2-Trees 3055.6.6 Mapping Patterns 3075.6.7 More Graph Varieties 3095.6.8 Data Structures 3105.6.9 Galton–Watson Branching Process 3125.6.10 Erdös–Rényi Evolutionary Process 312

5.7 Lengyel’s Constant 3165.7.1 Stirling Partition Numbers 316

P1: IKB


xiv Contents

5.7.2 Chains in the Subset Lattice of S 3175.7.3 Chains in the Partition Lattice of S 3185.7.4 Random Chains 320

5.8 Takeuchi–Prellberg Constant 3215.9 Pólya’s Random Walk Constants 322

5.9.1 Intersections and Trappings 3275.9.2 Holonomicity 328

5.10 Self-Avoiding Walk Constants 3315.10.1 Polygons and Trails 3335.10.2 Rook Paths on a Chessboard 3345.10.3 Meanders and Stamp Foldings 334

5.11 Feller’s Coin Tossing Constants 3395.12 Hard Square Entropy Constant 342

5.12.1 Phase Transitions in Lattice Gas Models 3445.13 Binary Search Tree Constants 3495.14 Digital Search Tree Constants 354

5.14.1 Other Connections 3575.14.2 Approximate Counting 359

5.15 Optimal Stopping Constants 3615.16 Extreme Value Constants 3635.17 Pattern-Free Word Constants 3675.18 Percolation Cluster Density Constants 371

5.18.1 Critical Probability 3725.18.2 Series Expansions 3735.18.3 Variations 374

5.19 Klarner’s Polyomino Constant 3785.20 Longest Subsequence Constants 382

5.20.1 Increasing Subsequences 3825.20.2 Common Subsequences 384

5.21 k-Satisfiability Constants 3875.22 Lenz–Ising Constants 391

5.22.1 Low-Temperature Series Expansions 3925.22.2 High-Temperature Series Expansions 3935.22.3 Phase Transitions in Ferromagnetic Models 3945.22.4 Critical Temperature 3965.22.5 Magnetic Susceptibility 3975.22.6 Q and P Moments 3985.22.7 Painlevé III Equation 401

5.23 Monomer–Dimer Constants 4065.23.1 2D Domino Tilings 4065.23.2 Lozenges and Bibones 4085.23.3 3D Domino Tilings 408

5.24 Lieb’s Square Ice Constant 4125.24.1 Coloring 413

P1: IKB


Contents xv

5.24.2 Folding 4145.24.3 Atomic Arrangement in an Ice Crystal 415

5.25 Tutte–Beraha Constants 416

6 Constants Associated with Functional Iteration 4206.1 Gauss’ Lemniscate Constant 420

6.1.1 Weierstrass Pe Function 4226.2 Euler–Gompertz Constant 423

6.2.1 Exponential Integral 4246.2.2 Logarithmic Integral 4256.2.3 Divergent Series 4256.2.4 Survival Analysis 425

6.3 Kepler–Bouwkamp Constant 4286.4 Grossman’s Constant 4296.5 Plouffe’s Constant 4306.6 Lehmer’s Constant 4336.7 Cahen’s Constant 4346.8 Prouhet–Thue–Morse Constant 436

6.8.1 Probabilistic Counting 4376.8.2 Non-Integer Bases 4386.8.3 External Arguments 4396.8.4 Fibonacci Word 4396.8.5 Paper Folding 439

6.9 Minkowski–Bower Constant 4416.10 Quadratic Recurrence Constants 4436.11 Iterated Exponential Constants 448

6.11.1 Exponential Recurrences 4506.12 Conway’s Constant 452

7 Constants Associated with Complex Analysis 4567.1 Bloch–Landau Constants 4567.2 Masser–Gramain Constant 4597.3 Whittaker–Goncharov Constants 461

7.3.1 Goncharov Polynomials 4637.3.2 Remainder Polynomials 464

7.4 John Constant 4657.5 Hayman Constants 468

7.5.1 Hayman–Kjellberg 4687.5.2 Hayman–Korenblum 4687.5.3 Hayman–Stewart 4697.5.4 Hayman–Wu 470

7.6 Littlewood–Clunie–Pommerenke Constants 4707.6.1 Alpha 470

P1: IKB


xvi Contents

7.6.2 Beta and Gamma 4717.6.3 Conjectural Relations 472

7.7 Riesz–Kolmogorov Constants 4737.8 Grötzsch Ring Constants 475

7.8.1 Formula for a(r ) 477

8 Constants Associated with Geometry 4798.1 Geometric Probability Constants 4798.2 Circular Coverage Constants 4848.3 Universal Coverage Constants 489

8.3.1 Translation Covers 4908.4 Moser’s Worm Constant 491

8.4.1 Broadest Curve of Unit Length 4938.4.2 Closed Worms 4938.4.3 Translation Covers 495

8.5 Traveling Salesman Constants 4978.5.1 Random Links TSP 4988.5.2 Minimum Spanning Trees 4998.5.3 Minimum Matching 500

8.6 Steiner Tree Constants 5038.7 Hermite’s Constants 5068.8 Tammes’ Constants 5088.9 Hyperbolic Volume Constants 5118.10 Reuleaux Triangle Constants 5138.11 Beam Detection Constant 5158.12 Moving Sofa Constant 5198.13 Calabi’s Triangle Constant 5238.14 DeVicci’s Tesseract Constant 5248.15 Graham’s Hexagon Constant 5268.16 Heilbronn Triangle Constants 5278.17 Kakeya–Besicovitch Constants 5308.18 Rectilinear Crossing Constant 5328.19 Circumradius–Inradius Constants 5348.20 Apollonian Packing Constant 5378.21 Rendezvous Constants 539

Table of Constants 543Author Index 567Subject Index 593Added in Press 601

P1: IKB


Preface

All numbers are not created equal. The fact that certain constants appear at all andthen echo throughout mathematics, in seemingly independent ways, is a source offascination. Formulas involving ϕ, e, π , or γ understandably fill a considerable portionof this book.

There are also many constants whose purposes are more specialized. Often suchexotic quantities have been buried in the literature, known only to the experts of anarrow field, and invisible to the wider public. In some cases, the constants are easilycomputable; in other cases, they may be known to only one decimal digit of precision(or worse, none at all). Even rigorous proofs of existence might be unavailable.

My belief is that these latter constants are not as isolated as they may seem. Theassociated branches of research (unlike those involving ϕ, e, π , or γ ) might simplyrequire more time to develop the languages, functions, symmetries, etc., to express theconstants more naturally. That is, if we work and listen hard enough, the echoes willbecome audible.

An elaborate taxonomy of mathematical constants has not yet been achieved; hencethe organization of this book (by discipline) is necessarily subjective. A table of decimalapproximations at the end gives an alternative organizational strategy (if ascendingnumerical order is helpful). The emphasis for me is not on the decimal expansions,but rather on the mathematical origins of the constants and their interrelationships. Inshort, the stories, not the table, tie the book together.

Material about well-known constants appears early and carefully, for the sake ofreaders without much mathematical background. Deeper into the text, however, I nec-essarily become more terse. My intended audience is advanced undergraduates andbeyond (so I may assume readers have had calculus, matrix theory, differential equa-tions, probability, some abstract algebra, and analysis). My aim is always to be clearand complete, to motivate why a particular constant or idea is important, and to in-dicate exactly where in the literature one should look for rigorous proofs and furtherelaboration.

I have incorporated Richard Guy’s use of the ampersand (&) to denote joint work.For example, phrases like “ . . . follows from the work of Hardy & Ramanujan and

xvii

P1: IKB


xviii Preface

Rademacher” are unambiguous when presented as here. The notation [3, 7] meansreferences 3 and 7, whereas [3.7] refers to Section 3.7 of this book. The presence of acomma or decimal point is clearly crucial.

Many people have speculated on the role of the Internet in education and research.I have no question about the longstanding impact of the Web as a whole, but I remainskeptical that any specific Web address I might give here will exist in a mere five years.Of all mathematical Web sites available today, I expect that at least the following threewill survive the passage of time:

• the ArXiv preprint server at Los Alamos National Laboratory (the meaning of apointer to “math.CA/9910045” or to “solv-int/9801008” should be apparent to allArXiv visitors),

• MathSciNet, established by the American Mathematical Society (subscribers tothis service will be acquainted with Mathematical Reviews and the meaning of“MR 3,270e,” “MR 33 #3320,” or “MR 87h:51043”), and

• the On-Line Encyclopedia of Integer Sequences, created by Neil Sloane (a sequenceidentifier such as “A000688” will likewise suffice),

but not many more will outlive us. Even those that persist will be moved to variousnew locations and the old addresses will eventually fail. I have therefore chosen notto include Web URLs in this book. When I cite a Web site (e.g., “Numbers, Constantsand Computation,” “Prime Pages,” “MathPages,” “Plouffe’s Tables,” or “GeometryJunkyard”), the reference will be by name only.

A project of this magnitude cannot possibly be the work of one person. These pagesare filled with innumerable acts of kindness by friends. To express my appreciationto all would considerably lengthen this preface; hence I will not attempt this. Specialthanks are due to Philippe Flajolet, my mentor, who provided valuable encouragementfrom the very beginning. I am grateful to Victor Adamchik, Christian Bower, AnthonyGuttmann, Joe Keane, Pieter Moree, Gerhard Niklasch, Simon Plouffe, Pascal Sebah,Craig Tracy, John Wetzel, and Paul Zimmermann. I am also indebted to MathSoft Inc.,∗

the Algorithms Group at INRIA, and CECM at Simon Fraser University for providingWeb sites for my online research notes – my window to the world! – and to CambridgeUniversity Press for undertaking this publishing venture with me.

Comments, corrections, and suggestions from readers are always welcome. Pleasesend electronic mail to [email protected]. Thank you.

∗ Portions of this book are C© 2000–2003 MathSoft Engineering & Education, Inc. and are reprinted withpermission.

P1: IKB


Notation

�x� floor function: largest integer ≤ x�x ceiling function: smallest integer ≥ x{x} fractional part: x − �x�ln x natural logarithm: loge x(

n

k

)binomial coefficient:

n!

k!(n − k)!b0 + a1||b1 +

a2||b2 +

a3||b3 + · · · continued fraction: b0 +

a1

b1 + a2b2 + a3

b3 + · · ·f (x) = O(g(x)) big O: | f (x)/g(x)| is bounded from above as x → x0f (x) = o(g(x)) little o: f (x)/g(x) → 0 as x → x0f (x) ∼ g(x) asymptotic equivalence: f (x)/g(x) → 1 as x → x0∑

p

summation over all prime numbers p = 2, 3, 5, 7, 11, . . .(only when the letter p is used)∏

p

same as∑

p , with addition replaced by multiplication

f (x)n power: ( f (x))n , where n is an integer

f n(x) iterate: f ( f (· · · f︸︷︷︸n times

(x) . . .)) where n ≥ 0 is an integer

xix

P1: IKB


xx

P1: FHB/SPH P2: FHB/SPH QC: FHB/SPH T1: FHB

CB503-01 CB503/Finch-v2.cls December 9, 2004 13:35 Char Count=

1

Well-Known Constants

1.1 Pythagoras’ Constant,√

2

The diagonal of a unit square has length√

2 = 1.4142135623 . . . . A theory, proposedby the Pythagorean school of philosophy, maintained that all geometric magnitudescould be expressed by rational numbers. The sides of a square were expected to becommensurable with its diagonals, in the sense that certain integer multiples of onewould be equivalent to integer multiples of the other. This theory was shattered by thediscovery that

√2 is irrational [1–4].

Here are two proofs of the irrationality of√

2, the first based on divisibility propertiesof the integers and the second using well ordering.

• If√

2 were rational, then the equation p2 = 2q2 would be solvable in integers p andq, which are assumed to be in lowest terms. Since p2 is even, p itself must be evenand so has the form p = 2r . This leads to 2q2 = 4r2 and thus q must also be even.But this contradicts the assumption that p and q were in lowest terms.

• If√

2 were rational, then there would be a least positive integer s such that s√

2 is aninteger. Since 1 < 2, it follows that 1 <

√2 and thus t = s · (√2 − 1) is a positive

integer. Also t√

2 = s · (√2 − 1)√2 = 2s − s√2 is an integer and clearly t < s.But this contradicts the assumption that s was the smallest such integer.

Newton’s method for solving equations gives rise to the following first-order recur-rence, which is very fast and often implemented:

x0 = 1, xk = xk−12

+ 1xk−1

for k ≥ 1, limk→∞

xk =√

2.

Another first-order recurrence [5] yields the reciprocal of√

2:

y0 = 12, yk = yk−1

(3

2− y2k−1

)for k ≥ 1, lim

k→∞yk = 1√

2.

1



2 1 Well-Known Constants

The binomial series, also due to Newton, provides two interesting summations [6]:

1 +∞∑

n=1

(−1)n−122n(2n − 1)

(2n

n

)= 1 + 1

2− 1

2 · 4 +1 · 3

2 · 4 · 6 − + · · · =√

2,

1 +∞∑

n=1

(−1)n22n

(2n

n

)= 1 − 1

2+ 1 · 3

2 · 4 −1 · 3 · 52 · 4 · 6 + − · · · =

1√2.

The latter is extended in [1.5.4]. We mention two beautiful infinite products [5, 7, 8]

∞∏n=1

(1 + (−1)

n+1

2n − 1)

=(

1 + 11

) (1 − 1

3

) (1 + 1

5

) (1 − 1

7

)· · · =

√2,

∞∏n=1

(1 − 1

4(2n − 1)2)

= 1 · 32 · 2 ·

5 · 76 · 6 ·

9 · 1110 · 10 ·

13 · 1514 · 14 · · · =

1√2

and the regular continued fraction [9]

2 + 12 + 1

2 + 12 + · · ·

= 2 + 1||2 +1||2 +

1||2 + · · · = 1 +

√2 = (−1 +

√2)−1,

which is related to Pell’s sequence

a0 = 0, a1 = 1, an = 2an−1 + an−2 for n ≥ 2via the limiting formula

limn→∞

an+1an

= 1 +√

2.

This is completely analogous to the famous connection between the Golden mean ϕand Fibonacci’s sequence [1.2]. See also Figure 1.1.

Viète’s remarkable product for Archimedes’ constant π [1.4.2] involves only thenumber 2 and repeated square-root extractions. Another expression connecting π andradicals appears in [1.4.5].

1

1

√2

1

1

ϕ

Figure 1.1. The diagonal of a regular unit pentagon, connecting any two nonadjacent corners,has length given by the Golden mean ϕ (rather than by Pythagoras’ constant).



1.1 Pythagoras’ Constant,√

2 3

We return finally to irrationality issues: There obviously exist rationals x and y suchthat x y is irrational (just take x = 2 and y = 1/2). Do there exist irrationals x and ysuch that x y is rational? The answer to this is very striking. Let

z =√

2√

2.

If z is rational, then take x = y = √2. If z is irrational, then take x = z and y = √2,and clearly x y = 2. Thus we have answered the question (“yes”) without addressing theactual arithmetical nature of z. In fact, z is transcendental by the Gel’fond–Schneidertheorem [10], proved in 1934, and hence is irrational. There are many unsolved prob-lems in this area of mathematics; for example, we do not know whether

√2

z =√

2√

2√

2

is irrational (let alone transcendental).

1.1.1 Generalized Continued Fractions

It is well known that any quadratic irrational possesses a periodic regular continuedfraction expansion and vice versa. Comparatively few people have examined the gen-eralized continued fraction [11–17]

w(p, q) = q +

p + 1q + p + · · ·

q + · · ·

q +p + 1 + · · ·

q + · · ·q + p + · · ·

q + · · ·

,

which exhibits a fractal-like construction. Each new term in a particular generation(i.e., in a partial convergent) is replaced according to the rules

p → p + 1q

, q → q + pq

in the next generation. Clearly

w = q +p + 1

w

w; that is, w3 − qw2 − pw − 1 = 0.

In the special case p = q = 3, the higher-order continued fraction converges to (−1 +3√

2)−1. It is conjectured that regular continued fractions for cubic irrationals behave likethose for almost all real numbers [18–21], and no patterns are evident. The ordinaryreplacement rule

r → r + 1r




is sufficient for the study of quadratic irrationals, but requires extension for broaderclasses of algebraic numbers.

Two alternative representations of 3√

2 are as follows [22]:

3√

2 = 1 + 13 + 3

a+ 1

b

, where a = 3 + 3a

+ 1b, b = 12 + 10

a+ 3

b

and [23]

3√

2 = 1 + 1||3 +2||2 +

4||9 +

5||2 +

7||15 +

8||2 +

10||21 +

11||2 + · · · .

Other usages of the phrase “generalized continued fractions” include those in [24], withapplication to simultaneous Diophantine approximation, and in [25], with a geometricinterpretation involving the boundaries of convex hulls.

1.1.2 Radical Denestings

We mention two striking radical denestings due to Ramanujan:

3√

3√

2 − 1 = 3√

1

9− 3

√2

9+ 3

√4

9,

2√

3√

5 − 3√4 = 13(

3√

2 + 3√20 − 3√25)

.

Such simplifications are an important part of computer algebra systems [26].

[1] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., OxfordUniv. Press, 1985, pp. 38–45; MR 81i:10002.

[2] F. J. Papp,√

2 is irrational, Int. J. Math. Educ. Sci. Technol. 25 (1994) 61–67; MR94k:11081.

[3] O. Toeplitz, The Calculus: A Genetic Approach, Univ. of Chicago Press, 1981, pp. 1–6;MR 11,584e.

[4] K. S. Brown, Gauss’ lemma without explicit divisibility arguments (MathPages).[5] X. Gourdon and P. Sebah, The square root of 2 (Numbers, Constants and Computation).[6] K. Knopp, Theory and Application of Infinite Series, Hafner, 1951, pp. 208–211, 257–258;

MR 18,30c.[7] I. S. Gradshteyn and I. M. Ryzhik, Tables of Integrals, Series and Products, Academic

Press, 1980, p. 12; MR 97c:00014.[8] F. L. Bauer, An infinite product for square-rooting with cubic convergence, Math. Intellig.

20 (1998) 12–13, 38.[9] L. Lorentzen and H. Waadeland, Continued Fractions with Applications, North-Holland,

1992, pp. 10–16, 564–565; MR 93g:30007.[10] C. L. Siegel, Transcendental Numbers, Princeton Univ. Press, 1949, pp. 75–84; MR

11,330c.[11] D. Gómez Morin, La Quinta Operación Aritmética: Revolución del Número, 2000.[12] A. K. Gupta and A. K. Mittal, Bifurcating continued fractions, math.GM/0002227.[13] A. K. Mittal and A. K. Gupta, Bifurcating continued fractions II, math.GM/0008060.[14] G. Berzsenyi, Nonstandardly continued fractions, Quantum Mag. (Jan./Feb. 1996) 39.[15] E. O. Buchman, Problem 4/21, Math. Informatics Quart., v. 7 (1997) n. 1, 53.[16] A. Dorito and K. Ekblaw, Solution of problem 2261, Crux Math., v. 24 (1998) n. 7, 430–431.[17] W. Janous and N. Derigiades, Solution of problem 2363, Crux Math., v. 25 (1999) n. 6,

376–377.



1.2 The Golden Mean, ϕ 5

[18] J. von Neumann and B. Tuckerman, Continued fraction expansion of 21/3, Math. TablesOther Aids Comput. 9 (1955) 23–24; MR 16,961d.

[19] R. D. Richtmyer, M. Devaney, and N. Metropolis, Continued fraction expansions of alge-braic numbers, Numer. Math. 4 (1962) 68–84; MR 25 #44.

[20] A. D. Brjuno, The expansion of algebraic numbers into continued fractions (in Russian),Zh. Vychisl. Mat. Mat. Fiz. 4 (1964) 211–221; Engl. transl. in USSR Comput. Math. Math.Phys., v. 4 (1964) n. 2, 1–15; MR 29 #1183.

[21] S. Lange and H. Trotter, Continued fractions for some algebraic numbers, J. Reine Angew.Math. 255 (1972) 112–134; addendum 267 (1974) 219–220; MR 46 #5258 and MR 50#2086.

[22] F. O. Pasicnjak, Decomposition of a cubic algebraic irrationality into branching continuedfractions (in Ukrainian), Dopovidi Akad. Nauk Ukrain. RSR Ser. A (1971) 511–514, 573;MR 45 #6765.

[23] G. S. Smith, Expression of irrationals of any degree as regular continued fractions withintegral components, Amer. Math. Monthly 64 (1957) 86–88; MR 18,635d.

[24] W. F. Lunnon, Multi-dimensional continued fractions and their applications, Computers inMathematical Research, Proc. 1986 Cardiff conf., ed. N. M. Stephens and M. P. Thorne,Clarendon Press, 1988, pp. 41–56; MR 89c:00032.

[25] V. I. Arnold, Higher-dimensional continued fractions, Regular Chaotic Dynamics 3 (1998)10–17; MR 2000h:11012.

[26] S. Landau, Simplification of nested radicals, SIAM J. Comput. 21 (1992) 81–110; MR92k:12008.

1.2 The Golden Mean, ϕ

Consider a line segment:

What is the most “pleasing” division of this line segment into two parts? Some peoplemight say at the halfway point:

•Others might say at the one-quarter or three-quarters point. The “correct answer” is,however, none of these, and is supposedly found in Western art from the ancient Greeksonward (aestheticians speak of it as the principle of “dynamic symmetry”):

•If the right-hand portion is of length v = 1, then the left-hand portion is of lengthu = 1.618 . . . . A line segment partitioned as such is said to be divided in Golden orDivine section. What is the justification for endowing this particular division with suchelevated status? The length u, as drawn, is to the whole length u + v, as the length v isto u:

u

u + v =v

u.

Letting ϕ = u/v, solve for ϕ via the observation that

1 + 1ϕ

= 1 + vu

= u + vu

= uv

= ϕ.




The positive root of the resulting quadratic equation ϕ2 − ϕ − 1 = 0 is

ϕ = 1 +√

5

2= 1.6180339887 . . . ,

which is called the Golden mean or Divine proportion [1, 2].The constant ϕ is intricately related to Fibonacci’s sequence

f0 = 0, f1 = 1, fn = fn−1 + fn−2 for n ≥ 2.This sequence models (in a naive way) the growth of a rabbit population. Rabbits areassumed to start having bunnies once a month after they are two months old; theyalways give birth to twins (one male bunny and one female bunny), they never die, andthey never stop propagating. The number of rabbit pairs after n months is fn .

What can ϕ possibly have in common with { fn}? This is one of the most remarkableideas in all of mathematics. The partial convergents leading up to the regular continuedfraction representation of ϕ,

ϕ = 1 + 11 + 1

1 + 11 + · · ·

= 1 + 1||1 +1||1 +

1||1 + · · · ,

are all ratios of successive Fibonacci numbers; hence

limn→∞

fn+1fn

= ϕ.

This result is also true for arbitrary sequences satisfying the same recursion fn =fn−1 + fn−2, assuming that the initial terms f0 and f1 are distinct [3, 4].

The rich geometric connection between the Golden mean and Fibonacci’s sequenceis seen in Figure 1.2. Starting with a single Golden rectangle (of length ϕ and width1), there is a natural sequence of nested Golden rectangles obtained by removing theleftmost square from the first rectangle, the topmost square from the second rectangle,etc. The length and width of the nth Golden rectangle can be written as linear expres-sions a + bϕ, where the coefficients a and b are always Fibonacci numbers. TheseGolden rectangles can be inscribed in a logarithmic spiral as pictured. Assume thatthe lower left corner of the first rectangle is the origin of an xy-coordinate system.

1

ϕ − 1

5 − 3ϕ5ϕ − 8

2 − ϕ

2ϕ − 3

Figure 1.2. The Golden spiral circumscribes the sequence of Golden rectangles.




The accumulation point for the spiral can be proved to be ( 15 (1 + 3ϕ), 15 (3 − ϕ)). Suchlogarithmic spirals are “equiangular” in the sense that every line through (x∞, y∞)cuts across the spiral at a constant angle ξ . In this way, logarithmic spirals generalizeordinary circles (for which ξ = 90◦). The logarithmic spiral pictured gives rise to theconstant angle ξ = arccot( 2

πln(ϕ)) = 72.968 . . .◦ . Logarithmic spirals are evidently

found throughout nature; for example, the shell of a chambered nautilus, the tusks ofan elephant, and patterns in sunflowers and pine cones [4–6].

Another geometric application of the Golden mean arises when inscribing a regularpentagon within a given circle by ruler and compass. This is related to the fact that

2 cos(π

5

)= ϕ, 2 sin

(π5

)= √3 − ϕ.

The Golden mean, just as it has a simple regular continued fraction expansion, also hasa simple radical expansion [7]

ϕ =

√√√√1 +

√1 +

√1 +

√1 + √1 + · · · .

The manner in which this expansion converges toϕ is discussed in [1.2.1]. Like Pythago-ras’ constant [1.1], the Golden mean is irrational and simple proofs are given in [8, 9].

Here is a series [10] involving ϕ:

2√

5

5ln(ϕ) =

(1 − 1

2− 1

3+ 1

4

)+

(1

6− 1

7− 1

8+ 1

9

)

+(

1

11− 1

12− 1

13+ 1

14

)+ · · · ,

which reminds us of certain series connected with Archimedes’ constant [1.4.1]. Adirect expression for ϕ as a sum can be obtained from the Taylor series for the squareroot function, expanded about 4. The Fibonacci numbers appear in yet another repre-sentation [11] of ϕ:

4 − ϕ =∞∑

n=0

1

f2n= 1

f1+ 1

f2+ 1

f4+ 1

f8+ · · · .

Among many other possible formulas involving ϕ, we mention the four Rogers–Ramanujan continued fractions

1

α − ϕ exp(

−2π5

)= 1 + e

−2π ∣∣|1 +

e−4π∣∣

|1 +e−6π

∣∣|1 +

e−8π∣∣

|1 + · · · ,

1

β − ϕ exp(

− 2π√5

)= 1 +

e−2π√

5∣∣∣

|1 +e−4π

√5∣∣∣

|1 +e−6π

√5∣∣∣

|1 +e−8π

√5∣∣∣

|1 + · · · ,

1

κ − (ϕ − 1) exp(−π

5

)= 1 − e

−π ∣∣|1 +

e−2π∣∣

|1 −e−3π

∣∣|1 +

e−4π∣∣

|1 − + · · · ,

1

λ − (ϕ − 1) exp(

− π√5

)= 1 −

e−π√

5∣∣∣

|1 +e−2π

√5∣∣∣

|1 −e−3π

√5∣∣∣

|1 +e−4π

√5∣∣∣

|1 − + · · · ,




where

α =(ϕ√

5) 1

2, α′ = 1√

5

((ϕ − 1)√5

) 52, β =

√5

1 + 5√α′ − 1 ,

κ =(

(ϕ − 1)√5) 1

2, κ ′ = 1√

5

(ϕ√

5) 5

2, λ =

√5

1 + 5√κ ′ − 1 .

The fourth evaluation is due to Ramanathan [9, 12–16].

1.2.1 Analysis of a Radical Expansion

The radical expansion [1.2] for ϕ can be rewritten as a sequence {ϕn}:ϕ1 = 1, ϕn =

√1 + ϕn−1 for n ≥ 2.

Paris [17] proved that the rate in which ϕn approaches the limit ϕ is given by

ϕ − ϕn ∼ 2C(2ϕ)n

as n → ∞,

where C = 1.0986419643 . . . is a new constant. Here is an exact characterization ofC . Let F(x) be the analytic solution of the functional equation

F(x) = 2ϕF(ϕ −√

ϕ2 − x), |x | < ϕ2,subject to the initial conditions F(0) = 0 and F ′(0) = 1. Then C = ϕF(1/ϕ). A power-series technique can be used to evaluate C numerically from these formulas. It is simpler,however, to use the following product:

C =∞∏

n=2

2ϕ

ϕ + ϕn ,

which is stable and converges quickly [18].Another interesting constant is defined via the radical expression [7, 19]√√√√

1 +

√2 +

√3 +

√4 + √5 + · · · = 1.7579327566 . . . ,

but no expression of this in terms of other constants is known.

1.2.2 Cubic Variations of the Golden Mean

Perrin’s sequence is defined by

g0 = 3, g1 = 0, g2 = 2, gn = gn−2 + gn−3 for n ≥ 3and has the property that n > 1 divides gn if n is prime [20, 21]. The limit of ratios ofsuccessive Perrin numbers

ψ = limn→∞

gn+1gn




satisfies ψ3 − ψ − 1 = 0 and is given by

ψ =(

12 +

√69

18

) 13 + 13

(12 +

√69

18

)− 13 = 2√33 cos(

13 arccos

(3√

32

))= 1.3247179572 . . . .

This also has the radical expansion

ψ =3

√√√√1 +

3

√1 + 3

√1 + 3

√1 + 3√1 + · · · .

An amusing account of ψ is given in [20], where it is referred to as the Plastic constant(to contrast against the Golden constant). See also [2.30].

The so-called Tribonacci sequence [22, 23]

h0 = 0, h1 = 0, h2 = 1, hn = hn−1 + hn−2 + hn−3 for n ≥ 3has an analogous limiting ratio

χ =(

1927 +

√339

) 13 + 49

(1927 +

√339

)− 13 + 13 = 43 cos ( 13 arccos ( 198 )) + 13= 1.8392867552 . . . ,

that is, the real solution of χ3 − χ2 − χ − 1 = 0. See [1.2.3]. Consider also the four-numbers game: Start with a 4-vector (a, b, c, d) of nonnegative real numbers anddetermine the cyclic absolute differences (|b − a|, |c − b|, |d − c|, |a − d|). Iterateindefinitely. Under most circumstances (e.g., if a, b, c, d are each positive integers),the process terminates with the zero 4-vector after only a finite number of steps. Is thisalways true? No. It is known [24] that v = (1, χ, χ2, χ3) is a counterexample, as wellas any positive scalar multiple of v, or linear combination with the 4-vector (1, 1, 1, 1).Also, w = (χ3, χ2 + χ, χ2, 0) is a counterexample, as well as any positive scalarmultiple of w, or linear combination with the 4-vector (1, 1, 1, 1). These encompassall the possible exceptions. Note that, starting with w, one obtains v after one step.

1.2.3 Generalized Continued Fractions

Recall from [1.1.1] that generalized continued fractions are constructed via the replace-ment rule

p → p + 1q

, q → q + pq

applied to each new term in a particular generation. In particular, if p = q = 1, thepartial convergents are equal to ratios of successive terms of the Tribonacci sequence,and hence converge to χ . By way of contrast, the replacement rule [25, 26]

r → r + 1r + 1

r




is associated with a root of x3 − r x2 − r = 0. If r = 1, the limiting value is(

2954 +

√93

18

) 13 + 19

(2954 +

√93

18

)− 13 + 13 = 23 cos ( 13 arccos ( 292 )) + 13= 1.4655712318 . . . .

Other higher-order analogs of the Golden mean are offered in [27–29].

1.2.4 Random Fibonacci Sequences

Consider the sequence of random variables

x0 = 1, x1 = 1, xn = ±xn−1 ± xn−2 for n ≥ 2,where the signs are equiprobable and independent. Viswanath [30–32] proved the sur-prising result that

limn→∞

n√

|xn| = 1.13198824 . . .

with probability 1. Embree & Trefethen [33] proved that generalized random linearrecurrences of the form

xn = xn−1 ± βxn−2decay exponentially with probability 1 if 0 < β < 0.70258 . . . and grow exponentiallywith probability 1 if β > 0.70258 . . . .

1.2.5 Fibonacci Factorials

We mention the asymptotic result∏n

k=1 fk ∼ c · ϕn(n+1)/2 · 5−n/2 as n → ∞,where [34, 35]

c =∞∏

n=1

(1 − (−1)

n

ϕ2n

)= 1.2267420107 . . . .

See the related expression in [5.14].

[1] H. E. Huntley, The Divine Proportion: A Study in Mathematical Beauty, Dover, 1970.[2] G. Markowsky, Misconceptions about the Golden ratio, College Math. J. 23 (1992) 2–19.[3] S. Vajda, Fibonacci and Lucas numbers, and the Golden Section: Theory and Applications,

Halsted Press, 1989; MR 90h:11014.[4] C. S. Ogilvy, Excursions in Geometry, Dover, 1969, pp. 122–134.[5] E. Maor, e: The Story of a Number, Princeton Univ. Press, 1994, pp. 121–125, 134–139,

205–207; MR 95a:01002.[6] J. D. Lawrence, A Catalog of Special Plane Curves, Dover, 1972, pp. 184–186.[7] R. Honsberger, More Mathematical Morsels, Math. Assoc. Amer., 1991, pp. 140–144.[8] J. Shallit, A simple proof that phi is irrational, Fibonacci Quart. 13 (1975) 32, 198.[9] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford

Univ. Press, 1985, pp. 44–45, 290–295; MR 81i:10002.




[10] G. E. Andrews, R. Askey, and R. Roy, Special Functions, Cambridge Univ. Press, 1999,p. 58, ex. 52; MR 2000g:33001.

[11] R. Honsberger, Mathematical Gems III, Math. Assoc. Amer., 1985, pp. 102–138.[12] K. G. Ramanathan, On Ramanujan’s continued fraction, Acta Arith. 43 (1984) 209–226;

MR 85d:11012.[13] J. M. Borwein and P. B. Borwein, Pi and the AGM: A Study in Analytic Number Theory

and Computational Complexity, Wiley, 1987, pp. 78–81; MR 99h:11147.[14] B. C. Berndt, H. H. Chan, S.-S. Huang, S.-Y. Kang, J. Sohn, and S. H. Son, The Rogers-

Ramanujan continued fraction, J. Comput. Appl. Math. 105 (1999) 9–24; MR 2000b:11009.[15] H. H. Chan and V. Tan, On the explicit evaluations of the Rogers-Ramanujan continued

fraction, Continued Fractions: From Analytic Number Theory to Constructive Approxima-tion, Proc. 1998 Univ. of Missouri conf., ed. B. C. Berndt and F. Gesztesy, Amer. Math.Soc., 1999, pp. 127–136; MR 2000e:11161.

[16] S.-Y. Kang, Ramanujan’s formulas for the explicit evaluation of the Rogers-Ramanujancontinued fraction and theta-functions, Acta Arith. 90 (1999) 49–68; MR 2000f:11047.

[17] R. B. Paris, An asymptotic approximation connected with the Golden number, Amer. Math.Monthly 94 (1987) 272–278; MR 88d:39014.

[18] S. Plouffe, The Paris constant (Plouffe’s Tables).[19] J. M. Borwein and G. de Barra, Nested radicals, Amer. Math. Monthly 98 (1991) 735–739;

MR 92i:11011.[20] I. Stewart, Tales of a neglected number, Sci. Amer., v. 274 (1996) n. 7, 102–103; v. 275

(1996) n. 11, 118.[21] K. S. Brown, Perrin’s sequence (MathPages).[22] S. Plouffe, The Tribonacci constant (Plouffe’s Tables).[23] N. J. A. Sloane, On-Line Encyclopedia of Integer Sequences, A000073.[24] E. R. Berlekamp, The design of slowly shrinking labelled squares, Math. Comp. 29 (1975)

25–27; MR 51 #10133.[25] G. A. Moore, A Fibonacci polynomial sequence defined by multidimensional contin-

ued fractions and higher-order golden ratios, Fibonacci Quart. 31 (1993) 354–364; MR94g:11014.

[26] G. A. Moore, The limit of the golden numbers is 3/2, Fibonacci Quart. 32 (1994) 211–217;MR 95f:11008.

[27] P. G. Anderson, Multidimensional Golden means, Applications of Fibonacci Numbers,v. 5, Proc. 1992 St. Andrews conf., ed. G. E. Bergum, A. N. Philippou, and A. F. Horadam,Kluwer, 1993, pp. 1–9; MR 95a:11004.

[28] E. I. Korkina, The simplest 2-dimensional continued fraction (in Russian), Itogi NaukiTekh. Ser. Sovrem. Mat. Prilozh. Temat. Obz., v. 20, Topologiya-3, 1994; Engl. transl. inJ. Math. Sci. 82 (1996) 3680–3685; MR 97j:11032.

[29] E. I. Korkina, Two-dimensional continued fractions: The simplest examples, Singularitiesof Smooth Mappings with Additional Structures (in Russian), ed. V. I. Arnold, Trudy Mat.Inst. Steklov. 209 (1995) 143–166; Engl. transl. in Proc. Steklov Inst. Math. 209 (1995)124–144; MR 97k:11104.

[30] D. Viswanath, Random Fibonacci sequences and the number 1.13198824. . . , Math. Comp.69 (2000) 1131–1155; MR 2000j:15040.

[31] B. Hayes, The Vibonacci numbers, Amer. Scientist, v. 87 (1999) n. 4, 296–301.[32] I. Peterson, Fibonacci at random: Uncovering a new mathematical constant, Science News

155 (1999) 376.[33] M. Embree and L. N. Trefethen, Growth and decay of random Fibonacci sequences, Proc.

Royal Soc. London A 455 (1999) 2471–2485; MR 2001i:11098.[34] R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley,

1989, pp. 478, 571; MR 97d:68003.[35] S. Plouffe, The Fibonacci factorial constant (Plouffe’s Tables).[36] The Fibonacci Quarterly (virtually any issue).




1.3 The Natural Logarithmic Base, e

It is not known who first determined

limx→0

(1 + x)1x = e = 2.7182818284 . . . .

We see in this limit the outcome of a fierce tug-of-war. On the one side, the exponentexplodes to infinity. On the other side, 1 + x rushes toward the multiplicative identity1. It is interesting that the additive equivalent of this limit

limx→0

x · 1x

= 1

is trivial. A geometric characterization of e is as follows: e is the unique positive rootx of the equation

x∫1

1

udu = 1,

which is responsible for e being employed as the natural logarithmic base. In words, eis the unique positive number exceeding 1 for which the planar region bounded by thecurves v = 1/u, v = 0, u = 1, and u = e has unit area.

The definition of e implies that

d

dx(c · ex ) = c · ex

and, further, that any solution of the first-order differential equation

dy

dx= y(x)

must be of this form. Applications include problems in population growth and radioac-tive decay. Solutions of the second-order differential equation

d2 y

dx2= y(x)

are necessarily of the form y(x) = a · ex + b · e−x . The special case y(x) = cosh(x)(i.e., a = b = 1/2) is called a catenary and is the shape assumed by a certain uniformflexible cable hanging under its own weight. Moreover, if one revolves part of a catenaryaround the x-axis, the resulting surface area is smaller than that of any other curve withthe same endpoints [1, 2].

The series

e =∞∑

k=0

1

k!= 1 + 1

1+ 1

1 · 2 +1

1 · 2 · 3 + · · ·

is rapidly convergent – ordinary summation of the terms as listed is very quick forall practical purposes – so it may be surprising to learn that a more efficient meansfor computing the nth partial sum is possible [3, 4]. Define two functions p(a, b) and



1.3 The Natural Logarithmic Base, e 13

q(a, b) recursively as follows:

(p(a, b)q(a, b)

)=

(1b

)if b = a + 1,(

p(a, m)q(m, b) + p(m, b)q(a, m)q(m, b)

)otherwise, where

m = ⌊ a+b2 ⌋ .Then it is not difficult to show that 1 + p(0, n)/q(0, n) gives the desired partial sum.Such a binary splitting approach to computing e has fewer single-digit arithmeticoperations (i.e., reduced bit complexity) than the usual approach. Accelerated methodslike this grew out of [5–7]. When coupled with FFT-based integer multiplication, thisalgorithm is asymptotically as fast as any known.

The factorial series gives the following matching problem solution [8]. Let P(n) de-note the probability that a randomly chosen one-to-one function f : {1, 2, 3, . . . , n} →{1, 2, 3, . . . , n} has at least one fixed point; that is, at least one integer k for whichf (k) = k, 1 ≤ k ≤ n. Then

limn→∞ P(n) =

∞∑k=1

(−1)kk!

= 1 − 1e

= 0.6321205588 . . . .

See Figure 1.3; a generalization appears in [5.4]. Also, let X1, X2, X3, . . . be inde-pendent random variables, each uniformly distributed on the interval [0, 1]. Define aninteger N by

N = min{

n :n∑

k=1Xk > 1

};

then the expected value E(N ) = e. In the language of stochastics, a renewal processwith uniform interarrival times Xk has a mean renewal count involving the naturallogarithmic base [9].

0.5

0.4

0.3

0.2

0.1

00 1 2 3 4 5

Figure 1.3. Distribution of the number of fixed points of a random permutation f on n symbols,tending to Poisson(1) as n → ∞.




Break a stick of length r into m equal parts [10]. The integer m such that the productof the lengths of the parts is maximized is r/e or r/e + 1. See [5.15] for informationon a related application known as the secretary problem.

There are several Wallis-like infinite products [4, 11]

e = 21

·(

4

3

) 12

·(

6 · 85 · 7

) 14

·(

10 · 12 · 14 · 169 · 11 · 13 · 15

) 18

· · · ,

e

2=

(2

1

) 12

·(

2 · 43 · 3

) 14

·(

4 · 6 · 6 · 85 · 5 · 7 · 7

) 18

· · ·

and continued fractions [1.3.2] as well as the following fascinating connection to primenumber theory [12]. If we define

n? =∏p≤n

p prime

p, then limn→∞(n?)

1n = e,

which is a consequence of the Prime Number Theorem. Equally fascinating is the factthat

limn→∞

(n!)1n

n= 1

e

by Stirling’s formula; thus the growth of n! exceeds that of n? by an order of magnitude.We also have [13–15]

limn→∞(n!)

1n − ((n − 1)!)

1n−1 = 1

e, lim

n→∞

n∏k=1

(n2 + k)(n2 − k)−1 = e.

The irrationality of e was proved by Euler and its transcendence by Hermite; thatis, the natural logarithmic base e cannot be a zero of a polynomial with integer coeffi-cients [4, 16–18].

An unusual procedure for calculating e, known as the spigot algorithm, was firstpublicized in [19]. Here the intrigue lies not in the speed of the algorithm (it is slow)but in other characteristics: It is entirely based on integer arithmetic, for example.

Some people call e Euler’s constant, but the same phrase is so often used to refer tothe Euler–Mascheroni constant γ that confusion would be inevitable. Napier came veryclose to discovering e in 1614; consequently, some people call e Napier’s constant[1].

1.3.1 Analysis of a Limit

The Maclaurin series

1

e(1 + x)

1x = 1 − 1

2x + 11

24x2 − 7

16x3 + 2447

5760x4 − 959

2304x5 + O(x6)



1.3 The Natural Logarithmic Base, e 15

describes more fully what happens in the limiting definition of e; for example,

limx→0

(1 + x)1x − e

x= −1

2e, lim

x→0

(1 + x)1x − e

x+ 1

2e

x= 11

24e.

Quicker convergence is obtained by the formulas [20–24]:

limx→0

(2 + x2 − x

) 1x = e, lim

n→∞(n + 1)n+1

nn− n

n

(n − 1)n−1 = e.

To illustrate, the first terms in the corresponding asymptotic expansions are 1 + x2/12and 1 + 1/(24n2). Further improvements are possible.

1.3.2 Continued Fractions

The regular continued fraction for e,

e = 2 + 1||1 +1||2 +

1||1 +

1||1 +

1||4 +

1||1 +

1||1 +

1||6 +

1||1 + · · · ,

is (after suitable transformation) one of a family of continued fractions [25–28]:

coth

(1

m

)= e

2/m + 1e2/m − 1 = m +

1||3m +

1||5m +

1||7m +

1||9m + · · · ,

where m is any positive integer. Davison [29] obtained an algorithm for computingquotients of coth(3/2) and coth(2), for example, but no patterns can be found. Othercontinued fractions include [1, 26, 30, 31]

e − 1 = 1 + 2||2 +3||3 +

4||4 +

5||5 + · · · ,

1

e − 2 = 1 +1||2 +

2||3 +

3||4 +

4||5 + · · · ,

and still more can be found in [32, 33].

1.3.3 The Logarithm of Two

Finally, let us say a few words [34] about the closely related constant ln(2),

ln(2) =1∫0

1

1 + t dt = limn→∞n∑

k=1

1

n + k = 0.6931471805 . . . ,

which has limiting expressions similar to that for e:

limx→0

2x − 1x

= ln(2) = limx→0

2x − 2−x2x

.

Well-known summations include the Maclaurin series for ln(1 + x) evaluated at x = 1and x = −1/2,

ln(2) =∞∑

k=1

(−1)k−1k

=∞∑

k=1

1

k2k.




A binary digit extraction algorithm can be based on the series

ln(2) =∞∑

k=1

(1

8k + 8 +1

4k + 2)

1

4k,

which enables us to calculate the d th bit of ln(2) without being forced to calculate allthe preceding d − 1 bits. See also [2.1], [6.2], and [7.2].

[1] E. Maor, e: The Story of a Number, Princeton Univ. Press, 1994; MR 95a:01002.[2] G. F. Simmons, Differential Equations with Applications and Historical Notes, McGraw-

Hill, 1972, pp. 14–19, 52–54, 361–363; MR 58 #17258.[3] X. Gourdon and P. Sebah, Binary splitting method (Numbers, Constants and Computation).[4] J. M. Borwein and P. B. Borwein, Pi and the AGM: A Study in Analytic Number The-

ory and Computational Complexity, Wiley, 1987, pp. 329–330, 343, 347–362; MR 99h:11147.

[5] R. P. Brent, The complexity of multiple-precision arithmetic, Complexity of ComputationalProblem Solving, Proc. 1974 Austral. Nat. Univ. conf., ed. R. S. Anderssen and R. P. Brent,Univ. of Queensland Press, 1976, pp. 126–165.

[6] R. P. Brent, Fast multiple-precision evaluation of elementary functions, J. ACM 23 (1976)242–251; MR 52 #16111.

[7] E. A. Karatsuba, Fast evaluation of transcendental functions (in Russian), ProblemyPeredachi Informatsii 27 (1991) 76–99; Engl. transl. in Problems Information Transmission27 (1991) 339–360; MR 93c:65027.

[8] M. H. DeGroot, Probability and Statistics, Addison-Wesley, 1975, pp. 36–37.[9] W. Feller, On the integral equation of renewal theory, Annals of Math. Statist. 12 (1941)

243–267; MR 3,151c.[10] N. Shklov and C. E. Miller, Maximizing a certain product, Amer. Math. Monthly 61 (1954)

196–197.[11] I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series and Products, Academic Press,

1980, p. 12; MR 97c:00014.[12] T. Nagell, Introduction to Number Theory, Chelsea, 1981, pp. 38, 60–64; MR 30 #4714.[13] J. Sandor, On the gamma function. II, Publ. Centre Rech. Math. Pures 28 (1997) 10–12.[14] G. Pólya and G. Szegö, Problems and Theorems in Analysis, v. 1, Springer-Verlag, 1972,

ex. 55; MR 81e:00002.[15] Z. Sasvári and W. F. Trench, A Pólya-Szegö exercise revisited, Amer. Math. Monthly 106

(1999) 781–782.[16] J. A. Nathan, The irrationality of exp(x) for nonzero rational x , Amer. Math. Monthly 105

(1998) 762–763; MR 99e:11096.[17] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford

Univ. Press, 1985, pp. 46–47; MR 81i:10002.[18] I. N. Herstein, Topics in Algebra, 2nd ed., Wiley, 1975, pp. 216–219; MR 50 #9456.[19] A. H. J. Sale, The calculation of e to many significant digits, Computer J. 11 (1968)

229–230.[20] L. F. Richardson and J. A. Gaunt, The deferred approach to the limit, Philos. Trans. Royal

Soc. London Ser. A 226 (1927) 299–361.[21] H. J. Brothers and J. A. Knox, New closed-form approximations to the logarithmic constant

e, Math. Intellig., v. 20 (1998) n. 4, 25–29; MR 2000c:11209.[22] J. A. Knox and H. J. Brothers, Novel series-based approximations to e, College Math. J. 30

(1999) 269–275; MR 2000i:11198.[23] J. Sandor, On certain limits related to the number e, Libertas Math. 20 (2000) 155–159;

MR 2001k:26034.[24] X. Gourdon and P. Sebah, The constant e (Numbers, Constants and Computation).



1.4 Archimedes’ Constant, π 17

[25] L. Euler, De fractionibus continuis dissertatio, 1744, Opera Omnia Ser. I, v. 14,Lipsiae, 1911, pp. 187–215; Engl. transl. in Math. Systems Theory 18 (1985) 295–328;MR 87d:01011b.

[26] L. Lorentzen and H. Waadeland, Continued Fractions with Applications, North-Holland,1992, pp. 561–562; MR 93g:30007.

[27] P. Ribenboim, My Numbers, My Friends, Springer-Verlag, 2000, pp. 292–294; MR2002d:11001.

[28] C. D. Olds, The simple continued fraction expansion of e, Amer. Math. Monthly 77 (1970)968–974.

[29] J. L. Davison, An algorithm for the continued fraction of el/m , Proc. 8th Manitoba Conf.on Numerical Mathematics and Computing, Winnipeg, 1978, ed. D. McCarthy and H. C.Williams, Congr. Numer. 22, Utilitas Math., 1979, pp. 169–179; MR 80j:10012.

[30] L. Euler, Introduction to Analysis of the Infinite. Book I, 1748, transl. J. D. Blanton, Springer-Verlag, 1988, pp. 303–314; MR 89g:01067.

[31] H. Darmon and J. McKay, A continued fraction and permutations with fixed points, Amer.Math. Monthly 98 (1991) 25–27; MR 92a:05003.

[32] J. Minkus and J. Anglesio, A continued fraction, Amer. Math. Monthly 103 (1996) 605–606.[33] M. J. Knight and W. O. Egerland, Fn = (n + 2)Fn−1 − (n − 1)Fn−2, Amer. Math. Monthly

81 (1974) 675–676.[34] X. Gourdon and P. Sebah, The logarithm constant log(2) (Numbers, Constants and Com-

putation).

1.4 Archimedes’ Constant, π

Any brief treatment of π , the most famous of the transcendental constants, is necessarilyincomplete [1–5]. Its innumerable appearances throughout mathematics stagger themind.

The area enclosed by a circle of radius 1 is

A = π = 41∫0

√1 − x2dx = lim

n→∞4

n2

n∑k=0

√n2 − k2 = 3.1415926535 . . .

while its circumference is

C = 2π = 41∫0

1√1 − x2 dx = 4

1∫0

√1 +

(d

dx

√1 − x2

)2dx .

The formula for A is based on the definition of area in terms of a Riemann integral, thatis, a limit of Riemann sums. The formula for C uses the definition of arclength, given acontinuously differentiable curve. How is it that the same mysterious π appears in bothformulas? A simple integration by parts provides the answer, with no trigonometryrequired [6].

In the third century B.C., Archimedes considered inscribed and circumscribed reg-ular polygons of 96 sides and deduced that 3 1071 < π < 3

17 . The recursion

a0 = 2√

3, b0 = 3,an+1 = 2anbn

an + bn , bn+1 =√

an+1bn for n ≥ 0




(often called the Borchardt–Pfaff algorithm) essentially gives Archimedes’ estimateon the fourth iteration [7–11]. It is only linearly convergent (meaning that the numberof iterations is roughly proportional to the number of correct digits). It resembles thearithmetic-geometric-mean (AGM) recursion discussed with regard to Gauss’ lemnis-cate constant [6.1].

The utility of π is not restricted to planar geometry. The volume enclosed by asphere of radius 1 in n-dimensional Euclidean space is

V =

π k

k!if n = 2k,

22k+1k!

(2k + 1)!πk if n = 2k + 1,

while its surface area is

S =

2π k

(k − 1)! if n = 2k,

22k+1k!

(2k)!π k if n = 2k + 1.

These formulas are often expressed in terms of the gamma function, which we discussin [1.5.4]. The planar case (a circle) corresponds to n = 2.

Another connection between geometry and π arises in Buffon’s needle prob-lem [1, 12–15]. Suppose a needle of length 1 is thrown at random on a plane marked byparallel lines of distance 1 apart. What is the probability that the needle will intersectone of the lines? The answer is 2/π = 0.6366197723. . . .

Here is a completely different probabilistic interpretation [16, 17] of π . Suppose twointegers are chosen at random. What is the probability that they are coprime, that is,have no common factor exceeding 1? The answer is 6/π2 = 0.6079271018 . . . (in thelimit over large intervals). Equivalently, let R(N ) be the number of distinct rationalnumbers a/b with integers a, b satisfying 0 < a, b < N . The total number of orderedpairs (a, b) is N 2, but R(N ) is strictly less than this since many fractions are not inlowest terms. More precisely, by preceding statements, R(N ) ∼ 6N 2/π2.

Among the most famous limits in mathematics is Stirling’s formula [18]:

limn→∞

n!

e−nnn+1/2=

√2π = 2.5066282746 . . . .

Archimedes’ constant has many other representations too, some of which are given later.It was proved to be irrational by Lambert and transcendental by Lindemann [2, 16, 19].The first truly attractive formula for computing decimal digits of π was found byMachin [1, 13]:

π

4= 4 arctan

(1

5

)− arctan

(1

239

)

= 4∞∑

k=0

(−1)k(2k + 1) · 52k+1 −

∞∑k=0

(−1)k(2k + 1) · 2392k+1 .




The advantage of this formula is that the second term converges very rapidly and thefirst is nice for decimal arithmetic. In 1706, Machin became the first individual tocorrectly compute 100 digits of π .

We skip over many years of history and discuss one other significant algorithm dueto Salamin and Brent [2, 20–23]. Define a recursion by

a0 = 1, b0 = 1/√

2, c0 = 1/2, s0 = 1/2,an+1 = an + bn

2, bn+1 =

√anbn, cn+1 =

(cn

4an+1

)2, sn+1 = sn − 2n+1cn+1

for n ≥ 0. Then the ratio 2a2n/sn converges quadratically to π (meaning that eachiteration approximately doubles the number of correct digits). Even faster cubic andquartic algorithms were obtained by Borwein & Borwein [2, 22, 24, 25]; these drawupon Ramanujan’s work on modular equations. These are each a far cry computationallyfrom Archimedes’ approach. Using techniques like these, Kanada computed close toa trillion digits of π .

There is a spigot algorithm for calculating π just as for e [26]. Far more im-portant, however, is the digit-extraction algorithm discovered by Bailey, Borwein &Plouffe [27–29] based on the formula

π =∞∑

k=0

1

16k

×(

4 + 8r8k + 1 −

8r

8k + 2 −4r

8k + 3 −2 + 8r8k + 4 −

1 + 2r8k + 5 −

1 + 2r8k + 6 +

r

8k + 7)

(for r = 0) and requiring virtually no memory. (The extension to complex r �= 0 is dueto Adamchik & Wagon [30, 31].) A consequence of this breakthrough is that we nowknow the quadrillionth digit in the binary expansion for π , thanks largely to Bellardand Percival. An analogous base-3 formula was found by Broadhurst [32].

Some people call π Ludolph’s constant after the mathematician Ludolph van Ceulenwho devoted most of his life to computing π to 35 decimal places.

The formulas in this essay have a qualitatively different character than thosefor the natural logarithmic base e. Wimp [33] elaborated on this: What he called“e-mathematics” is linear, explicit, and easily capable of abstraction, whereas“π -mathematics” is nonlinear, mysterious, and generalized usually with difficulty.Cloitre [34], however, gave formulas suggesting a certain symmetry between e andπ : If u1 = v1 = 0, u2 = v2 = 1 and

un+2 = un+1 + unn

, vn+2 = vn+1n

+ vn, n ≥ 0,

then limn→∞ n/un = e whereas limn→∞ 2n/v2n = π .




1.4.1 Infinite Series

Over five hundred years ago, the Indian mathematician Madhava discovered the for-mula [35–38]

π

4=

∞∑n=0

(−1)n2n + 1 = 1 −

1

3+ 1

5− 1

7+ 1

9− 1

11+ − · · · ,

which was independently found by Gregory [39] and Leibniz [40]. This infinite seriesis conditionally convergent; hence its terms may be rearranged to produce a series thathas any desired sum or even diverges to +∞ or −∞. The same is also true for thealternating harmonic series [1.3.3]. For example, we have

1

4ln(2) + π

4= 1 + 1

5− 1

3+ 1

9+ 1

13− 1

7+ 1

17+ 1

21− 1

11+ + − · · ·

(two positive terms for each negative term). Generalization is possible.Changing the pattern of plus and minus signs in the Gregory–Leibniz series, for

example, gives [41, 42]

π

4

√2 = 1 + 1

3− 1

5− 1

7+ 1

9+ 1

11− 1

13− 1

15+ + − − · · ·

or extracting a subseries gives [43]

π

8(1 +

√2) = 1 − 1

7+ 1

9− 1

15+ 1

17− 1

23+ 1

25− 1

31+ − · · · .

We defer discussion of Euler’s famous series

∞∑n=1

1

n2= π

2

6,

∞∑n=1

(−1)n+1(2n − 1)3 =

π3

32

until [1.6] and [1.7]. Among many other series of his, there is [1, 44]

π

2=

∞∑n=0

2n

(2n + 1)(2nn ) = 1 +1

3+ 1 · 2

3 · 5 +1 · 2 · 33 · 5 · 7 + · · · .

We note that [2, 45]

∞∑n=1

1

n2(2n

n

) = π218

,

∞∑n=1

(−1)n+1n2

(2nn

) = 2 ln(ϕ)2

and wonder in what other ways π and the Golden mean ϕ [1.2] can be so intricatelylinked.

Ramanujan [23, 24, 46] and Chudnovsky & Chudnovsky [47–50] discovered seriesat the foundation of some of the fastest known algorithms for computing π .




1.4.2 Infinite Products

Viète [51] gave the first known analytical expression for π :

2

π=

√2

2·√

2 + √22

·√

2 +√

2 + √22

·

√2 +

√2 +

√2 + √2

2· · · ,

which he obtained by considering a limit of areas of Archimedean polygons, andWallis [52] derived the formula

π

2= 2

1· 2

3· 4

3· 4

5· 6

5· 6

7· 8

7· 8

9· · · = lim

n→∞24n

(2n + 1)(2nn )2.

These products are, in fact, children of the same parent [53]. We might prove theirtruth in many different ways [54]. One line of reasoning involves what some regardas the definition of sine and cosine. The following infinite polynomial factorizationshold [55]:

sin(x) = x∞∏

n=1

(1 − x

2

n2π2

), cos(x) =

∞∏n=1

(1 − 4x

2

(2n − 1)2π2)

.

The sine and cosine functions form the basis for trigonometry and the study of periodicphenomena in mathematics. Applications include the undamped simple oscillations ofa mechanical or electrical system, the orbital motion of planets around the sun, andmuch more [56]. It is well known that

d2

dx2(a · sin(x) + b · cos(x)) + (a · sin(x) + b · cos(x)) = 0

and, further, that any solution of the second-order differential equation

d2 y

dx2+ y(x) = 0

must be of this form. The constant π plays the same role in determining sine and cosineas the natural logarithmic base e plays in determining the exponential function. Thatthese two processes are interrelated is captured by Euler’s formula eiπ + 1 = 0, wherei is the imaginary unit.

Famous products relating π and prime numbers appear in [1.6] and [1.7], as aconsequence of the theory of the zeta function. One such product, due to Euler, is [57]

π

2=

∏p odd

p

p + (−1)(p−1)/2 =3

2· 5

6· 7

6· 11

10· 13

14· 17

18· 19

18· · · ,

where the numerators are the odd primes and the denominators are the closest integersof the form 4n + 2. See also [2.1]. A different appearance of π in number theory is theasymptotic expression

p(n) ∼ 14√

3nexp

(π

√2n

3

)




due to Hardy & Ramanujan [58], where p(n) is the number of unrestricted parti-tions of the positive integer n (order being immaterial). Hardy & Ramanujan [58]and Rademacher [59] proved an exact analytical formula for p(n) [60, 61], which is toofar afield for us to discuss here.

1.4.3 Definite Integrals

The most famous integrals include [62, 63]

∞∫0

e−x2dx =

√π

2(Gaussian probability density integral),

∞∫0

1

1 + x2 dx =π

2(limiting value of arctangent),

∞∫0

sin(x2)dx =∞∫0

cos(x2)dx = π√

2

4(Fresnel integrals),

π2∫0

ln(sin(x))dx =π2∫0

ln(cos(x))dx = −π2

ln(2),

1∫0

√ln

(1

x

)dx =

√π

2.

It is curious that

∞∫0

cos(x)

1 + x2 dx =π

2e,

∞∫0

x sin(x)

1 + x2 dx =π

2e

have simple expressions, but interchanging cos(x) and sin(x) give complicated results.See [6.2] for details.

Also, consider the following sequence:

sn =∞∫0

(sin(x)

x

)ndx, n = 1, 2, 3, . . . .

The first several values are s1 = s2 = π/2, s3 = 3π/8, s4 = π/3, s5 = 115π/384, ands6 = 11π/40. An exact formula for sn , valid for all n, is found in [64].




1.4.4 Continued Fractions

Starting with Wallis’s formula, Brouncker [1, 2, 52] discovered the continued fraction

1 + 4π

= 2 + 12∣∣

|2 +32

∣∣|2 +

52∣∣

|2 +72

∣∣|2 +

92∣∣

|2 + · · · ,

which was subsequently proved by Euler [41]. It is fascinating to compare this withother related expansions, for example [65–67],

4

π= 1 + 1

2∣∣

|3 +22

∣∣|5 +

32∣∣

|7 +42

∣∣|9 +

52∣∣

|11 + · · · ,

6

π2 − 6 = 1 +12

∣∣|1 +

1 · 2||1 +

22∣∣

|1 +2 · 3||1 +

32∣∣

|1 +3 · 4||1 +

42∣∣

|1 + · · · ,

2

π − 2 = 1 +1 · 2||1 +

2 · 3||1 +

3 · 4||1 +

4 · 5||1 +

5 · 6||1 +

6 · 7||1 + · · · ,

12

π2= 1 + 1

4∣∣

|3 +24

∣∣|5 +

34∣∣

|7 +44

∣∣|9 +

54∣∣

|11 + · · · ,

π + 3 = 6 + 12∣∣

|6 +32

∣∣|6 +

52∣∣

|6 +72

∣∣|6 +

92∣∣

|6 + · · · .

1.4.5 Infinite Radical

Let Sn denote the length of a side of a regular polygon of 2n+1 sides inscribed in aunit circle. Clearly S1 =

√2 and, more generally, Sn = 2 sin(π/2n+1). Hence, by the

half-angle formula,

Sn =√

2 −√

4 − S2n−1.

(A purely geometric argument for this recursion is given in [68, 69].) The circumferenceof the 2n+1-gon is 2n+1Sn and tends to 2π as n → ∞. Therefore

π = limn→∞ 2

n Sn = limn→∞ 2

n

√√√√√2 −

√√√√2 +

√2 +

√2 +

√2 + · · ·

√2,

where the right-hand side has n square roots.Although attractive, this radical expression for π is numerically sound only for a few

iterations. It is a classic illustration of the loss of floating-point precision that occurswhen subtracting two nearly equal quantities. There are many ways to approximate π :This is not one of them!




1

sin(x)

sn(x, )

−1−4π −2π 2π 4π0

12

x

Figure 1.4. The circular function sin(x) has period 2π ≈ 6.28, while the elliptic functionsn(x, 1/2) has (real) period 4K (1/2) ≈ 6.74.

1.4.6 Elliptic Functions

Consider an ellipse with semimajor axis length 1 and semiminor axis length 0 < r ≤ 1.The area enclosed by the ellipse is πr while its circumference is 4E

(√1 − r2

), where

K (x) =

π2∫0

1√1 − x2 sin(θ )2 dθ =

1∫0

1√(1 − t2)(1 − x2t2) dt,

E(x) =

π2∫0

√1 − x2 sin(θ )2 dθ =

1∫0

√1 − x2t21 − t2 dt

are complete elliptic integrals of the first and second kind. (One’s first encounter withK (x) is often with regard to computing the period of a physical pendulum [56].) Theanalog of the sine function is the Jacobi elliptic function sn(x, y), defined by

x =sn(x,y)∫

0

1√(1 − t2)(1 − y2t2) dt for 0 ≤ y ≤ 1.

See Figure 1.4. Clearly we have sn(x, 0) = sin(x) for −π/2 ≤ x ≤ π/2 and sn(x, 1) =tanh(x). An assortment of extended trigonometric identities involving sn and its coun-terparts cn and dn can be proved. For fixed 0 < y < 1, the function sn(x, y) canbe analytically continued over the whole complex plane to a doubly periodic mero-morphic function. Just as sin(z) = sin(z + 2π ) for all complex z, we have sn(z) =sn

(z + 4K (y) + 2i K

(√1 − y2

)). Hence the constants K (y) and K

(√1 − y2

)play

roles for elliptic functions analogous to the role π plays for circular functions [2, 70].

1.4.7 Unexpected Appearances

A fascinating number-theoretic function f (n) is described in [71–77]. Take any positiveinteger n, round it up to the nearest multiple of n − 1, then round this result up to thenearest multiple of n − 2, and then (more generally) round the kth result up to the




nearest multiple of n − k − 1. Stop when k = n − 1 and let f (n) be the final value.For example, f (10) = 34 since

10 → 18 → 24 → 28 → 30 → 30 → 32 → 33 → 34 → 34.The ratio n2/ f (n) approaches π as n increases without bound. In the same spirit,Matiyasevich & Guy [78] obtained

π = limm→∞

√6 · ln( f1 · f2 · f3 · · · fm)

ln(lcm( f1, f2, f3, . . . , fm)),

where f1, f2, f3, . . . is Fibonacci’s sequence [1.2] and lcm denotes least common multi-ple. It turns out that Fibonacci’s sequence may be replaced by many other second-order,linear recurring sequences without changing the limiting value π .

In [1.4.1] and [1.4.2], we saw expressions resembling(2n

n

)/(n + 1). These are known

as Catalan numbers and are important in combinatorics, for example, when enumer-ating strictly binary trees with 2n + 1 vertices. The average height hn of such treessatisfies

limn→∞

hn√n

= 2√π

by a theorem of Flajolet & Odlyzko [79, 80] (we introduce the language of trees in[5.6]). This is yet another unexpected appearance of the constant π .

[1] P. Beckmann, A History of π , St. Martin’s Press, 1971; MR 56 #8261.[2] J. M. Borwein and P. B. Borwein, Pi and the AGM: A Study in Analytic Number Theory and

Computational Complexity, Wiley, 1987, pp. 46–52, 169–177, 337–362, 385–386; MR99h:11147.

[3] D. Blatner, The Joy of Pi, Walker, 1997.[4] P. Eymard and J.-P. Lafon, Autour du nombre π , Hermann, 1999; MR 2001a:11001.[5] X. Gourdon and P. Sebah, The constant pi (Numbers, Constants and Computation).[6] E. F. Assmus, Pi, Amer. Math. Monthly 92 (1985) 213–214.[7] Archimedes, Measurement of a circle, 250 BC, in Pi: A Source Book, 2nd ed., ed. L.

Berggren, J. M. Borwein, and P. B. Borwein, Springer-Verlag, 2000, pp. 7–14; MR98f:01001.

[8] O. Toeplitz, The Calculus: A Genetic Approach, Univ. of Chicago Press, 1981, pp. 18–22;MR 11,584e.

[9] G. M. Phillips, Archimedes the numerical analyst, Amer. Math. Monthly 88 (1981) 165-169;also in Pi: A Source Book, pp. 15–19; MR 83e:01005.

[10] G. Miel, Of calculations past and present: The Archimedean algorithm, Amer. Math.Monthly 90 (1983) 17–35; MR 85a:01006.

[11] G. M. Phillips, Archimedes and the complex plane, Amer. Math. Monthly 91 (1984) 108–114; MR 85h:40003.

[12] S. D. Dubey, Statistical determination of certain mathematical constants and functionsusing computers, J. ACM 13 (1966) 511–525; MR 34 #2149.

[13] H. Dörrie, 100 Great Problems of Elementary Mathematics: Their History and Solution,Dover, 1965, pp. 73–77; MR 84b:00001.

[14] E. Waymire, Buffon noodles, Amer. Math. Monthly 101 (1994) 550–559; addendum 101(1994) 791; MR 95g:60021a and MR 95g:60021b.

[15] E. Wegert and L. N. Trefethen, From the Buffon needle problem to the Kreiss matrixtheorem, Amer. Math. Monthly 101 (1994) 132–139; MR 95b:30036.




[16] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., OxfordUniv. Press, 1985, pp. 47, 268–269; MR 81i:10002.

[17] A. M. Yaglom and I. M. Yaglom, Challenging Mathematical Problems with ElementarySolutions, v. I, Holden-Day, 1964, ex. 92–93; MR 88m:00012a.

[18] A. E. Taylor and R. Mann, Advanced Calculus, 2nd ed., Wiley, 1972, pp. 740–745; MR83m:26001.

[19] T. Nagell, Introduction to Number Theory, Chelsea, 1981, pp. 38, 60–64; MR 30 #4714.[20] R. P. Brent, Fast multiple-precision evaluation of elementary functions, J. ACM 23 (1976)

242–251; MR 52 #16111.[21] E. Salamin, Computation of π using arithmetic-geometric mean, Math. Comp. 30 (1976)

565–570; MR 53 #7928.[22] D. C. van Leijenhorst, Algorithms for the approximation of π , Nieuw Arch. Wisk. 14 (1996)

255–274; MR 98b:11130.[23] G. Almkvist and B. Berndt, Gauss, Landen, Ramanujan, the arithmetic-geometric mean,

ellipses, π , and the Ladies Diary, Amer. Math. Monthly 95 (1988) 585–608; MR 89j:01028.[24] J. M. Borwein, P. B. Borwein, and D. H. Bailey, Ramanujan, modular equations, and

approximations to pi, or how to compute one billion digits of pi, Amer. Math. Monthly96 (1989) 201–219; also in Organic Mathematics, Proc. 1995 Burnaby workshop, ed. J.Borwein, P. Borwein, L. Jörgenson, and R. Corless, Amer. Math. Soc., 1997, pp. 35–71;MR 90d:11143.

[25] J. M. Borwein and F. G. Garvan, Approximations to pi via the Dedekind eta function,Organic Mathematics, Proc. 1995 Burnaby workshop, Amer. Math. Soc., 1997, pp. 89–115; MR 98j:11030.

[26] S. Rabinowitz and S. Wagon, A spigot algorithm for the digits of π , Amer. Math. Monthly102 (1995) 195–203; MR 96a:11152.

[27] D. Bailey, P. Borwein, and S. Plouffe, On the rapid computation of various polylogarithmicconstants, Math. Comp. 66 (1997) 903–9

Mathematical Constants - Refkolrefkol.ro/matek/mathbooks/ro.math.wikia.com wiki...61 H. Groemer...

Documents

Transcript of Mathematical Constants - Refkolrefkol.ro/matek/mathbooks/ro.math.wikia.com wiki...61 H. Groemer...