English

Approximations to Euler's constant

Number Theory 2012-10-09 v1

Abstract

We study a problem of finding good approximations to Euler's constant γ=limnSn,\gamma=\lim_{n\to\infty}S_n, where Sn=k=1n1nlog(n+1),S_n=\sum_{k=1}^n\frac{1}{n}-\log(n+1), by linear forms in logarithms and harmonic numbers. In 1995, C. Elsner showed that slow convergence of the sequence SnS_n can be significantly improved if SnS_n is replaced by linear combinations of SnS_n with integer coefficients. In this paper, considering more general linear transformations of the sequence SnS_n we establish new accelerating convergence formulae for γ.\gamma. Our estimates sharpen and generalize recent Elsner's, Rivoal's and author's results.

Keywords

Cite

@article{arxiv.0708.2771,
  title  = {Approximations to Euler's constant},
  author = {Kh. Hessami Pilehrood and T. Hessami Pilehrood},
  journal= {arXiv preprint arXiv:0708.2771},
  year   = {2012}
}

Comments

11 pages

R2 v1 2026-06-21T09:09:10.755Z