**The Life of Pi: From Archimedes to Eniac and Beyond**

by Jonathan M. Borwein

**Publisher**: DocServer 2010**Number of pages**: 30

**Description**:

The desire to understand Pi, the challenge, and originally the need, to calculate ever more accurate values of Pi, the ratio of the circumference of a circle to its diameter, has challenged mathematicians -- great and less great -- for many many centuries and, especially recently, Pi has provided compelling examples of computational mathematics. Pi, uniquely in mathematics is pervasive in popular culture and the popular imagination.

Download or read it online for free here:

**Download link**

(5.4MB, PDF)

## Similar books

**Numerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics**

by

**Justin Solomon**-

**CRC Press**

Using examples from a broad base of computational tasks, including data processing and computational photography, the book introduces numerical modeling and algorithmic design from a practical standpoint and provides insight into theoretical tools.

(

**5626**views)

**Algorithmic Algebra**

by

**Bhubaneswar Mishra**-

**Courant Institute of Mathematical Sciences**

The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra.

(

**18747**views)

**A Computational Introduction to Number Theory and Algebra**

by

**Victor Shoup**-

**Cambridge University Press**

This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.

(

**37150**views)

**Mathematics for Algorithm and Systems Analysis**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

(

**26287**views)