On the computation of the n^th decimal digit of various transcendental numbers

Details On the computation of the n^th decimal digit of various transcendental numbers On the computation of the n^th decimal digit of various transcendental numbers

2009-12-02

arxiv.org/abs/0912.0303v1

Mathematics

Number Theory

Reprint of an unpublished article from November 30, 1996

Scientific paper

A method for computing the n'th decimal digit of pi in O(n^3 log(n)^3) time and with very little memory is presented here. The computation is based on the recently discovered Bailey-Borwein-Plouffe algorithm and the use of a new algorithm that simply splits an ordinary fraction into its components. The algorithm can be used to compute other numbers like zeta(3), pi*sqrt(3), pi^2 and 2/sqrt(5) ln(phi) where phi is the golden ratio. The computation can be achieved without having to compute the preceding digits. I claim that the algorithm has a more theoretical rather than practical interest, I have not found a faster algorithm or proved that it cannot exist.

Affiliated with

Also associated with

No associations

Rating

On the computation of the n^th decimal digit of various transcendental numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the computation of the n^th decimal digit of various transcendental numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the computation of the n^th decimal digit of various transcendental numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508179