On Computing Euler's Constant
From MaRDI portal
Publication:3137732
DOI10.2307/2691242zbMATH Open0858.11067OpenAlexW4206025853MaRDI QIDQ3137732FDOQ3137732
Authors: Jeffrey Nunemacher
Publication date: 14 November 1993
Full work available at URL: https://doi.org/10.2307/2691242
Evaluation of number-theoretic constants (11Y60) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Cited In (8)
- Euler's constant, Stirling's approximation and the Riemann zeta function
- Interval computation of Viswanath's constant
- A bound for the error term in the Brent-McMillan algorithm
- Title not available (Why is that?)
- Computation of Tangent, Euler, and Bernoulli Numbers
- Monotone and fast computation of Euler's constant
- Computation of the Regular Continued Fraction for Euler's Constant
- The harmonic series: Historical and mathematical aspects
This page was built for publication: On Computing Euler's Constant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137732)