On the computation of the Euler constant

From MaRDI portal
Publication:1587026





Let \(H(n)=n^2 \Bigl[1+{1 \over 2}+ \cdots+ {1\over n}-\log \Bigl( n+ {1\over 2}\Bigr) -C\Bigr],\) where \(C\) is the Euler constant. The author proves a conjecture of Matti Vuorinen which states that \(H(n)\) increases monotonically from \(H(1)=0.0173 \dots\) to \(\lim_{n\to \infty} H(n)=1/24= 0.0416 \dots\) \((n=1,2,3, \dots)\). There appear also some new formulas for the computation of \(C\).




Cited in
(37)








This page was built for publication: On the computation of the Euler constant \({\gamma}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587026)