AngouriMath
EulerGamma(PeterO.Numbers.EContext)
Method (no overloads)
Summary
Euler's constant, gamma = lim (1 + 1/2 + ... + 1/n - ln n) , to the precision of
work , by Brent and McMillan's algorithm B1: with
B_k = (n^k/k!)^2 and A_k = B_k (H_k - ln n) , gamma is
sum A_k/sum B_k to within pi e^(-4n) , so n is a quarter of the
digits'ln 10 . The terms stay positive past k = n , where they are largest,
and ten guard digits cover what the first ones cancel.
digits'
and ten guard digits cover what the first ones cancel.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online