Skip to main content
Springer logoLink to Springer
. 2018 Jun 19;2018(1):136. doi: 10.1186/s13660-018-1727-6

A series of sequences convergent to Euler’s constant

Li-Jiang Jia 1, Bin Ge 2,, Li-Li Liu 2, Yi Ran 2
PMCID: PMC6006293  PMID: 30137733

Abstract

In this paper, using continued fraction, we provide a new quicker sequence convergent to Euler’s constant. We demonstrate the superiority of our new convergent sequences over DeTemple’s sequence, Mortici’s sequences, Vernescu’s sequence, and Lu’s sequence.

Keywords: Euler’s constant, Rate of convergence, Asymptotic expansion

Introduction

As it is known, defining some new approximations toward fundamental constants plays an important role in the field of mathematical constants. One of the most famous constants is Euler’s constant γ=0.577215, which is defined as the limit of the sequence

γn=k=1n1klnn 1.1

and has numerous applications in many areas of pure and applied mathematics, such as analysis, number theory, theory of probability, applied statistics, and special functions.

Up until now, many authors have devoted great efforts and achieved much in the area of improving the convergence rate of the sequence (γn)n1. Among them, there are many inspiring achievements. For example, the estimate

12(n+1)<γnγ<12n(Young) 1.2

was given in [14].

In [5, 6], a new sequence (Dn)n1 converging faster to γ was introduced, which is defined as

Dn=1+12+13++1nln(n+12). 1.3

DeTemple also concluded that the speed of the new sequence to γ is of order n2 since

124(n+1)2<Dnγ<124n2(DeTemple). 1.4

Another modification was provided by Vernescu [7] as

Vn=1+12+13++1n1+12nlnn, 1.5

who proved that

112(n+1)2<γVn<112n2. 1.6

It is easy to conclude that though (1.3) and (1.5) only make slight modifications on the Euler’s sequence (1.1), but the convergent rates are significantly improved from n1 to n2.

Moreover, Mortici obtained some sequences converging even faster than (1.1), (1.3), and (1.5). More specifically, Mortici [8] constructed the following two sequences:

un=1+12+13++1n1+1(626)nln(n+16), 1.7
vn=1+12+13++1n1+1(6+26)nln(n16). 1.8

Both (1.7) and (1.8) had been proved to converge to γ as n3.

Moreover, Mortici [9] introduced the following class of sequences:

μn(a,b)=k=1n1k+ln(ea/(n+b)1)lna, 1.9

where a,bR, a>0. They proved that, among the sequences (μn(a,b))n1, in the case of a=2/2 and b=(2+2)/4 the privileged sequence offers the best approximations of γ since

limnn3(μn(22,2+24)γ)=296. 1.10

Recently, Lu, Song, and Yu [10] provided some approximations of Euler’s constant. A new important sequence was defined as follows:

γn,k(s)=1+12+13++1nlnn1kln(1+a1n+a2nn+a3nn+a4nn++as), 1.11

where

a1=k2,a2=23k12,a3=3k2+412(3k2),a4=15k430k3+60k2104k+9620(3k2)(3k2+4),.

Two particular sequences were provided as

γn,1(2)=1+12+13++1nlnnln(1+a1n+a2), 1.12
γn,2(3)=1+12+13++1nlnn12ln(1+a1n+a2nn+a3). 1.13

These two sequences converge faster than all other sequences mentioned since for all nN,

7288(n+1)3<γγn,1(2)<7288n3and1180(n+1)4<γγn,2(3)<1180(n1)4.

On the other hand, Lu [11] introduced the following class of sequences:

Kn,k(s)=1+12+13++1nlnn1kln(1+a1n+a2n2+a3n3++asns), 1.14

where k,sN. They also proved that, among the sequences (Kn,k(s))n1, in the case of

a1=k2,a2=k(3k2)24,a3=k2(k2)48,a4=k(15k360k2+20k+48)5760,,

the privileged sequence offers the best approximations of γ since when s=1,

limnn2(Kn,k(1)γ)=3k224; 1.15

when s=2,

limnn3(Kn,k(2)γ)=k22k48; 1.16

when s=3,

limnn4(Kn,k(3)γ)=15k360k2+20k+485760. 1.17

These works motivated our study. In this paper, our main goal is to modify the sequence based on the early works of DeTemple, Moritici, and Lu and provide a new convergent sequence of relatively simple form with higher speed.

The rest of this paper is arranged as follows. In Sect. 2, we provide the main results and, in Sect. 3, we prove them.

The main results

Lemma 2.1

For any fixed a,bR, we have the following convergent sequence for Euler’s constant:

Nn,a,b=1+12+13++1n1+1anln(n+b). 2.1

Moreover, for a=1 and b=0, we have

limnn(N(n,1,0)γ)=12; 2.2

for a=1 and b=1/2, we have

limnn2(N(n,1,12)γ)=124; 2.3

for a=2 and b=0, we have

limnn2(N(n,2,0)γ)=124; 2.4

for a=626 and b=1/6, we have

limnn3(N(n,626,16)γ)=1186; 2.5

and for a=6+26 and b=1/6, we have

limnn3(N(n,6+26,16)γ)=1186. 2.6

Using Lemma 2.1, we have the following conclusion.

Corollary 2.2

The fastest possible sequence (Nn,a,b)n1 is obtained only for

{1ab12=0,1a+b2+b+13=0,

and

limnn3(Nn,a,bγ)=13(1ab33b32b14). 2.7

Theorem 2.3

For any fixed sN, there exist kN and a,bR such that the following sequence converges to Euler’s constant:

γγn,k,a,b(s)=1+12+13++1n1+1anln(n+b)1kln(1+a1n+a2n2+a3n3++asns), 2.8

where

a1=k(1ab12),a2=12a+b22+b2+16+(2k2abkak)28a2k+2k2abkak4ak,a3=k3ab3k3b2k2bk3k12a13a122+a2+a1a2a133,.

Furthermore, let

γn,k,a,b(1)=1+12+13++1n1+1anln(n+b)1kln(1+a1n), 2.9
γn,k,a,b(2)=1+12+13++1n1+1anln(n+b)1kln(1+a1n+a2n2), 2.10
γn,k,a,b(3)=1+12+13++1n1+1anln(n+b)1kln(1+a1n+a2n2+a3n3). 2.11

Then we also have, for s=1,

limnn3(γn,k,a,b(1)γ)=4k4ab3k6ab2k4abkak4aa16aa124aa1312ak; 2.12

for s=2,

limnn4(γn,k,a,b(2)γ)=14a+b44+b22+b4+120; 2.13

and for s=3,

limnn5(γn,a,b,k(3)γ)=15ab55b422b33b22b5130a15k+a2k3a35k+2a1a2k+a2a3k2a1a3ka12a3ka1a22k+2a12a2k+a13a2ka142k2a133k4a1525. 2.14

Lemma 2.4

If (xn)n1 converges to zero and there exists the limit

limnns(xnxn+1)=l[,+] 2.15

with s>1, then

limnns1xn=ls1. 2.16

Lemma 2.4 was first proved by Moritici [12]. From Lemma 2.4 we can see that the speed of convergence of the sequence (xn)n1 increases together with the value s satisfying (2.15).

The proof of Theorem 2.3

Based on the argument of Theorem 2.1 in [13] or Theorem 5 in [14], we need to find the value of a1R that produces the most accurate approximation of the form

Nn,a,b=1+12+13++1n1+1anln(n+b). 3.1

To measure the accuracy of this approximation, a method is to say that an approximation (3.1) is better as Nn,a,bγ faster converges to zero. Using (3.1), we have

Nn,a,bNn+1,a,b=1n+1an1a(n+1)ln(n+b)+ln(n+1+b). 3.2

Developing in power series in 1/n, we have

Nn,a,bNn+1,a,b=(1ab12)1n2+(1a+b2+b+13)1n3+(1ab33b22b14)1n4+(1a+b4+2b3+2b2+b+1)1n5+O(1n6). 3.3

From Lemma 2.4 we know that the speed of convergence of the sequence (Nn,a,b)n1 is even higher than the value s satisfying (2.15). Thus, using Lemma 2.4, we have:

  • (i)
    If 1ab120, then the convergence rate of the sequence (Nn,a,bγ)n1 is 1/n since
    limnn(Nn,a,bγ)=1ab120.
  • (ii)
    If 1ab12=0, then from (3.3) we have
    Nn,a,bNn+1,a,b=(1a+b2+b+13)1n3+(1ab33b22b14)1n4+(1a+b4+2b3+2b2+b+1)1n5+O(1n6).

If 1a+b2+b+130, then the rate of convergence of the sequence (Nn,a,bγ)n1 is n2 since

limnn2(Nn,a,bγ)=12a+b22+b2+16.

If 1a+b2+b+13=0, then from (3.3) we have

Nn,a,bNn+1,a,b=(1ab33b22b14)1n4+(1a+b4+2b3+2b2+b+1)1n5+O(1n6),

and the rate of convergence of the sequence (Nn,a,bγ)n1 is n3 since

limnn3(Nn,a,bγ)=13ab33b22b3112.

Moreover, for a=1 and b=0, we have

limnn(N(n,1,0)γ)=12; 3.4

for a=1 and b=1/2, we have

limnn2(N(n,1,12)γ)=124; 3.5

for a=2 and b=0, we have

limnn2(N(n,2,0)γ)=124; 3.6

for a=626 and b=1/6, we have

limnn3(N(n,626,16)γ)=1186; 3.7

and for a=6+26 and b=1/6, we have

limnn3(N(n,6+26,16)γ)=1186. 3.8

Proof of Theorem 2.3

We define the sequence (γn,a,b,k(s))n1 by the relations

γγn,k,a,b(s)=1+12+13++1n1+1anln(n+b)1kln(1+a1n+a2n2+a3n3++asns) 3.9

and

γγn,k,a,b(1)=1+12+13++1n1+1anln(n+b)1kln(1+a1n). 3.10

Using a similar method as in (3.1)–(3.3), we have

γn,k,a,b(1)γn+1,k,a,b(1)=3k+3ab2k+3abk+ak+3aa1+3aa123akn3+2k2abkak2aa12akn2+4k4ab3k6ab2k4abkak4aa16aa124aa134akn4+5k+5ab4k+10ab3k+10ab2k+5abk+ak5aa1+10aa125akn5+10aa12+10aa13+5aa145akn5+O(1n6). 3.11

The fastest possible sequence (γn,a,b,k(1))n1 is obtained when

{2k2abkak2aa12ak=0,3k+3ab2k+3abk+ak+3aa1+3aa123ak=0.

Then we have

limnn3(γn,a,b,k(1)γ)=4k4ab3k6ab2k4abkak4aa16aa124aa1312ak,

and the rate of convergence is n3.

For example, for a=2 and b=1/(23),

limnn3(γn,2,123,k(1)γ)=k+33k+33k2k3723k,

and the rate of convergence is n3.

Next, we define the second sequence with the previous conclusions:

γn,k,a,b(2)=1+12+13++1n1+1anln(n+b)1kln(1+a1n+a2n2), 3.12

where a1=2k2abkak2a.

Then we get the equation

γn,k,a,b(2)γn+1,k,a,b(2)=(1a+b2+b+13+a12k+a1k2a2k)1n3+(1ab33b22b143a122k+3a1a2k)1n4+(a13ka1k+3a2k)1n4+(1a+b4+2b3+2b2+b+15+a1k4a2k+2a12k+2a22k6a1a2k+2a13k4a12a2k+a14k)1n5+O(1n6). 3.13

Taking

{a1=kabkk2,a2=k2a+b2k2+bk2+k6+a122+a12,1ab33b22b143a122k+3a1a2ka13ka1k+3a2k=0,

we obtain the fastest sequence (γn,a,b,k(2))n1 with convergent rate n4 since

limnn4(γn,a,b,k(2)γ)=14a+b44+b32+2b24+b4+120+a14ka2k+a122k+a222k3a1a22k+a132ka12a2k+a144k.

Moreover, for

{a1=kabkk2,a2=k2a+b2k2+bk2+k6+a122+a12,

we define the third sequence with the previous conclusions:

γn,k,a,b(3)=1+12+13++1n1+1anln(n+b)1kln(1+a1n+a2n2+a3n3). 3.14

Then we have the equality

γn,k,a,b(3)γn+1,k,a,b(3)=(1ab33b22b14a1k3a122k+3a2k3a3k+3a1a2ka13k)1n4+(1a+b4+2b3+2b2+b+15+a1k4a2k+2a22k+6a3k+2a12k+2a13k6a1a2k+4a1a3k4a12a2k+a14k)1n5+(1ab55b4210b335b22b16a1k+5a2k3a3k+10a1a2k+5a2a3k10a1a3k5a12a3k5a1a22k+10a12a2k+5a13a2k5a142k10a133k4a155)1n6+O(1n7). 3.15

Taking

{a3=k3ab3k3b2k2bk3k12a13a122+a2+a1a2a133,1a+b4+2b3+2b2+b+15+a1k4a2k+2a22k+6a3k+2a12k+2a13k,6a1a2k+4a1a3k4a12a2k+a14k=0,

we obtain the fastest sequence (γn,a,b,k(3))n1 with convergent rate n5 since

limnn5(γn,a,b,k(3)γ)=15ab55b422b33b22b5130a15k+a2k3a35k+2a1a2k+a2a3k2a1a3ka12a3ka1a22k+2a12a2k+a13a2ka142k2a133k4a1525.

 □

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Nos. U1706227, 11201095), the Youth Scholar Backbone Supporting Plan Project of Harbin Engineering University, the Fundamental Research Funds for the Central Universities (No. HEUCFM181102), the Postdoctoral research startup foundation of Heilongjiang (No. LBH-Q14044), and the Science Research Funds for Overseas Returned Chinese Scholars of Heilongjiang Province (No. LC201502).

Authors’ contributions

The authors contributed equally to this paper. All authors read and approved the final manuscript.

Funding

Not applicable.

Competing interests

The authors declare that they have no competing interests.

Footnotes

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Li-Jiang Jia, Email: jialj1979@126.com.

Bin Ge, Email: gebin791025@hrbeu.edu.cn.

Li-Li Liu, Email: liull@hrbeu.edu.cn.

Yi Ran, Email: ranyi@hrbeu.edu.cn.

References

  • 1.Mortici C., Vernescu A. An improvement of the convergence speed of the sequence (γn)n1 converging to Euler’s constant. An. Ştiinţ. Univ. “Ovidius” Constanţa. 2005;13:95–98. [Google Scholar]
  • 2.Mortici C., Vernescu A. Some new facts in discrete asymptotic analysis. Math. Balk. 2007;21:301–308. [Google Scholar]
  • 3.Vernescu A. The order of convergence of the sequence that defines the constant of Euler. Gaz. Mat., Ser. A. Buchar. 1983;88:380–381. [Google Scholar]
  • 4.Young R.M. Euler’s constant. Math. Gaz. 1991;75:187–190. doi: 10.2307/3620251. [DOI] [Google Scholar]
  • 5.DeTemple D.W. A quicker convergence to Euler’s constant. Am. Math. Mon. 1993;100:468–470. doi: 10.1080/00029890.1993.11990433. [DOI] [Google Scholar]
  • 6.DeTemple D.W. A geometric look at sequences that converge to Euler’s constant. Coll. Math. J. 2006;37:128–131. doi: 10.2307/27646302. [DOI] [Google Scholar]
  • 7.Vernescu A. A new accelerate convergence to the constant of Euler. Gaz. Mat., Ser. A. 1999;104:273–278. [Google Scholar]
  • 8.Mortici C. Optimizing the rate of convergence in some new classes of sequences convergent to Euler’s constant. Anal. Appl. 2010;8:99–107. doi: 10.1142/S0219530510001539. [DOI] [Google Scholar]
  • 9.Mortici C. A quicker convergence toward the γ constant with the logarithm term involving the constant e. Carpath. J. Math. 2010;26:86–91. [Google Scholar]
  • 10.Lu D., Song L., Yu Y. A new quicker sequence convergent to Euler’s constant. J. Number Theory. 2015;147:69–80. doi: 10.1016/j.jnt.2014.07.002. [DOI] [Google Scholar]
  • 11.Lu D. Some quicker classes of sequences convergent to Euler’s constant. Appl. Math. Comput. 2014;232:172–177. [Google Scholar]
  • 12.Mortici C. Product approximations via asymptotic integration. Am. Math. Mon. 2010;117:434–441. doi: 10.4169/000298910x485950. [DOI] [Google Scholar]
  • 13.Mortici C. A new Stirling series as continued fraction. Number Algoritm. 2011;56:17–27. doi: 10.1007/s11075-010-9370-4. [DOI] [Google Scholar]
  • 14.Mortici C. A continued fraction approximation of the gamma function. J. Math. Anal. Appl. 2013;402:405–410. doi: 10.1016/j.jmaa.2012.11.023. [DOI] [Google Scholar]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES