PART I: THE SETTING.

1. Introduction.

PART II: ALGORITHMS AND PROGRAMS.

2. Numbers, Algorithms and Programs.

3. Integer Powers.

4. Square Root.

5. Rational Powers.

6. Logarithms.

7. Archimedes' Calculation of π.

8. Calculating Trigonometric Functions.

9. CORDIC Calculation of Cosine.

PART III: DISPLAYING INFORMATION.

10. Graphing.

APPENDIXES.

A. A Primer on Programming.

B. Interpolation.

C. Pre-Electronic Calculation Tools.

D. Fermat's Last Theorem.

E. An Extension and an Application of Integer Division.

F. Binary Arithmetic.

G. Binary Subtraction.

H. The Rapid Convergence of Newton's Method.

I. How Newton's Method Applies to the Square Root Algorithm and the Rth Root of N.

J. The Ancient Greeks Approximate Square Root of 2.

K. Continued Fraction Approximations.

L. Multiplying Numbers with Many Digits.

M. Finding Equation Roots by Binary Search.

N. Derivation of the Logarithm Change of Base Formula.

O. The Ratio of Decimal to Binary Digits.

P. Constructing a Log Table.

Q. Relations between Sides of Inscribed and Circumscribed Polygons.

R. Change in Form of a Polygon Formula.

S. An Area Approach to Archimedes' Problem.

Further Reading: A Personal Selection.

Index.