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 , which is defined as the limit of the sequence
| 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 . Among them, there are many inspiring achievements. For example, the estimate
| 1.2 |
In [5, 6], a new sequence converging faster to γ was introduced, which is defined as
| 1.3 |
DeTemple also concluded that the speed of the new sequence to γ is of order since
| 1.4 |
Another modification was provided by Vernescu [7] as
| 1.5 |
who proved that
| 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 to .
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:
| 1.7 |
| 1.8 |
Both (1.7) and (1.8) had been proved to converge to γ as .
Moreover, Mortici [9] introduced the following class of sequences:
| 1.9 |
where , . They proved that, among the sequences , in the case of and the privileged sequence offers the best approximations of γ since
| 1.10 |
Recently, Lu, Song, and Yu [10] provided some approximations of Euler’s constant. A new important sequence was defined as follows:
| 1.11 |
where
Two particular sequences were provided as
| 1.12 |
| 1.13 |
These two sequences converge faster than all other sequences mentioned since for all ,
On the other hand, Lu [11] introduced the following class of sequences:
| 1.14 |
where . They also proved that, among the sequences , in the case of
the privileged sequence offers the best approximations of γ since when ,
| 1.15 |
when ,
| 1.16 |
when ,
| 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 , we have the following convergent sequence for Euler’s constant:
| 2.1 |
Moreover, for and , we have
| 2.2 |
for and , we have
| 2.3 |
for and , we have
| 2.4 |
for and , we have
| 2.5 |
and for and , we have
| 2.6 |
Using Lemma 2.1, we have the following conclusion.
Corollary 2.2
The fastest possible sequence is obtained only for
and
| 2.7 |
Theorem 2.3
For any fixed , there exist and such that the following sequence converges to Euler’s constant:
| 2.8 |
where
Furthermore, let
| 2.9 |
| 2.10 |
| 2.11 |
Then we also have, for ,
| 2.12 |
for ,
| 2.13 |
and for ,
| 2.14 |
Lemma 2.4
If converges to zero and there exists the limit
| 2.15 |
with , then
| 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 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 that produces the most accurate approximation of the form
| 3.1 |
To measure the accuracy of this approximation, a method is to say that an approximation (3.1) is better as faster converges to zero. Using (3.1), we have
| 3.2 |
Developing in power series in , we have
| 3.3 |
From Lemma 2.4 we know that the speed of convergence of the sequence is even higher than the value s satisfying (2.15). Thus, using Lemma 2.4, we have:
-
(i)If , then the convergence rate of the sequence is since
-
(ii)If , then from (3.3) we have
If , then the rate of convergence of the sequence is since
If , then from (3.3) we have
and the rate of convergence of the sequence is since
Moreover, for and , we have
| 3.4 |
for and , we have
| 3.5 |
for and , we have
| 3.6 |
for and , we have
| 3.7 |
and for and , we have
| 3.8 |
Proof of Theorem 2.3
We define the sequence by the relations
| 3.9 |
and
| 3.10 |
Using a similar method as in (3.1)–(3.3), we have
| 3.11 |
The fastest possible sequence is obtained when
Then we have
and the rate of convergence is .
For example, for and ,
and the rate of convergence is .
Next, we define the second sequence with the previous conclusions:
| 3.12 |
where .
Then we get the equation
| 3.13 |
Taking
we obtain the fastest sequence with convergent rate since
Moreover, for
we define the third sequence with the previous conclusions:
| 3.14 |
Then we have the equality
| 3.15 |
Taking
we obtain the fastest sequence with convergent rate since
□
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 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]
