2005 Research Fair Archive - Math Abstracts

A Detailed Study of Algorithms Converging to Pi
by Aaron Searle  (Faculty Sponsor:  Richard Wellman)

The transcendental number PI has been an important topic in mathematics throughout history. In this presentation we’ll discuss several of the methods for approximating of PI and show their convergence properties when implemented on a computer. We will show some unique algorithms for finding the approximation of PI, like the use of prime numbers. We will also consider a very efficient algorithm that computes, for an arbitrary integer n, the nth digit of the decimal expansion of PI.