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¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:17ddce971818 · see in the full table