On the Rapid Computation of Various Polylogarithmic Constants.¶
Bailey, D., Borwein, P., & Plouffe, S. (1997). On the Rapid Computation of Various Polylogarithmic Constants. Mathematics of Computation, 903-913.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Bailey–Borwein–Plouffe Formula
- … series evaluates to π. The powers of 16 and the arithmetic-progression denominators align with hexadecimal positional notation so that a distant block of hexadecimal digits can be computed from the fractional part of `16^n π` using modular exponentiation, without first storing or computing all preceding digits.
This sourceGives the identity, proof, modular digit algorithm, complexity discussion, and reported distant-digit computations.
- … series evaluates to π. The powers of 16 and the arithmetic-progression denominators align with hexadecimal positional notation so that a distant block of hexadecimal digits can be computed from the fractional part of `16^n π` using modular exponentiation, without first storing or computing all preceding digits.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:17ddce971818 · see in the full table