Number Theory


On the Rapid Computation of Various Polylogarithmic Constants

Authors: Simon Plouffe, David Bailey, Peter Borwein

We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log (2) or π on a modest work station in a few hours run time.

Comments: 13 Pages. a better copy

Download: PDF

Submission history

[v1] 2014-09-12 10:31:59
[v2] 2014-09-13 10:50:09

Unique-IP document downloads: 679 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus