- Research
- Open access
- Published:
A series of sequences convergent to Euler’s constant
Journal of Inequalities and Applications volume 2018, Article number: 136 (2018)
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.
1 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 \(\gamma =0.577215\dots \), which is defined as the limit of the sequence
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 \((\gamma_{n})_{n\geq 1}\). Among them, there are many inspiring achievements. For example, the estimate
In [5, 6], a new sequence \((D_{n})_{n\geq 1}\) converging faster to γ was introduced, which is defined as
DeTemple also concluded that the speed of the new sequence to γ is of order \(n^{-2}\) since
Another modification was provided by Vernescu [7] as
who proved that
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 \(n^{-1}\) to \(n^{-2}\).
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:
Both (1.7) and (1.8) had been proved to converge to γ as \(n^{-3}\).
Moreover, Mortici [9] introduced the following class of sequences:
where \(a,b\in \mathbb{R}\), \(a>0\). They proved that, among the sequences \((\mu_{n}(a,b))_{n\geq 1}\), in the case of \(a=\sqrt{2}/2\) and \(b=(2+\sqrt{2})/4\) the privileged sequence offers the best approximations of γ since
Recently, Lu, Song, and Yu [10] provided some approximations of Euler’s constant. A new important sequence was defined as follows:
where
Two particular sequences were provided as
These two sequences converge faster than all other sequences mentioned since for all \(n\in \mathbb{N}\),
On the other hand, Lu [11] introduced the following class of sequences:
where \(k,s\in \mathbb{N}\). They also proved that, among the sequences \((K_{n,k}^{(s)})_{n\geq 1}\), in the case of
the privileged sequence offers the best approximations of γ since when \(s=1\),
when \(s=2\),
when \(s=3\),
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.
2 The main results
Lemma 2.1
For any fixed \(a,b\in \mathbb{R}\), we have the following convergent sequence for Euler’s constant:
Moreover, for \(a=1\) and \(b=0\), we have
for \(a=1\) and \(b=1/2\), we have
for \(a=2\) and \(b=0\), we have
for \(a=6-2\sqrt{6}\) and \(b={1}/{\sqrt{6}}\), we have
and for \(a=6+2\sqrt{6}\) and \(b=-{1}/{\sqrt{6}}\), we have
Using Lemma 2.1, we have the following conclusion.
Corollary 2.2
The fastest possible sequence \((N_{n,a,b})_{n\geq 1}\) is obtained only for
and
Theorem 2.3
For any fixed \(s\in \mathbb{N}\), there exist \(k\in \mathbb{N}\) and \(a, b \in \mathbb{R}\) such that the following sequence converges to Euler’s constant:
where
Furthermore, let
Then we also have, for \(s=1\),
for \(s=2\),
and for \(s=3\),
Lemma 2.4
If \((x_{n})_{n\geq 1}\) converges to zero and there exists the limit
with \(s>1\), then
Lemma 2.4 was first proved by Moritici [12]. From Lemma 2.4 we can see that the speed of convergence of the sequence \((x_{n})_{n\geq 1}\) increases together with the value s satisfying (2.15).
3 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 \(a_{1}\in \mathbb{R} \) that produces the most accurate approximation of the form
To measure the accuracy of this approximation, a method is to say that an approximation (3.1) is better as \(N_{n,a,b}-\gamma \) faster converges to zero. Using (3.1), we have
Developing in power series in \(1/n\), we have
From Lemma 2.4 we know that the speed of convergence of the sequence \((N_{n,a,b})_{n\geq 1}\) is even higher than the value s satisfying (2.15). Thus, using Lemma 2.4, we have:
-
(i)
If \(\frac{1}{a}-b-\frac{1}{2}\neq 0 \), then the convergence rate of the sequence \((N_{n,a,b}-\gamma)_{n \geq 1}\) is \(1/n\) since
$$\lim_{n\rightarrow \infty }n(N_{n,a,b}-\gamma)= \frac{1}{a}-b- \frac{1}{2}\neq 0. $$ -
(ii)
If \(\frac{1}{a}-b-\frac{1}{2}=0 \), then from (3.3) we have
$$\begin{aligned} N_{n,a,b}-N_{n+1,a,b} = & \biggl(-\frac{1}{a}+b^{2}+b+ \frac{1}{3} \biggr)\frac{1}{n^{3}}+ \biggl(\frac{1}{a}-b^{3}- \frac{3b^{2}}{2}-b- \frac{1}{4} \biggr)\frac{1}{n^{4}} \\ &{}+ \biggl(-\frac{1}{a}+b^{4}+2b ^{3}+2b^{2}+b+1 \biggr) \frac{1}{n^{5}}+O \biggl(\frac{1}{n^{6}} \biggr). \end{aligned}$$
If \(-\frac{1}{a}+b^{2}+b+\frac{1}{3}\neq 0 \), then the rate of convergence of the sequence \((N_{n,a,b}-\gamma)_{n \geq 1}\) is \(n^{-2}\) since
If \(-\frac{1}{a}+b^{2}+b+\frac{1}{3}=0 \), then from (3.3) we have
and the rate of convergence of the sequence \((N_{n,a,b}-\gamma)_{n \geq 1}\) is \(n^{-3}\) since
Moreover, for \(a=1\) and \(b=0\), we have
for \(a=1\) and \(b=1/2\), we have
for \(a=2\) and \(b=0\), we have
for \(a=6-2\sqrt{6}\) and \(b={1}/{\sqrt{6}}\), we have
and for \(a=6+2\sqrt{6}\) and \(b=-{1}/{\sqrt{6}}\), we have
Proof of Theorem 2.3
We define the sequence \((\gamma_{n,a,b,k}^{(s)})_{n\geq 1}\) by the relations
and
Using a similar method as in (3.1)–(3.3), we have
The fastest possible sequence \((\gamma_{n,a,b,k}^{(1)})_{n\geq 1}\) is obtained when
Then we have
and the rate of convergence is \(n^{-3}\).
For example, for \(a=2\) and \(b=1/(2\sqrt{3})\),
and the rate of convergence is \(n^{-3}\).
Next, we define the second sequence with the previous conclusions:
where \(a_{1}=\frac{2k-2abk-ak}{2a} \).
Then we get the equation
Taking
we obtain the fastest sequence \((\gamma_{n,a,b,k}^{(2)})_{n\geq 1}\) with convergent rate \(n^{-4}\) since
Moreover, for
we define the third sequence with the previous conclusions:
Then we have the equality
Taking
we obtain the fastest sequence \((\gamma_{n,a,b,k}^{(3)})_{n\geq 1}\) with convergent rate \(n^{-5}\) since
□
References
Mortici, C., Vernescu, A.: An improvement of the convergence speed of the sequence \((\gamma_{n})_{n\geq 1}\) converging to Euler’s constant. An. Ştiinţ. Univ. “Ovidius” Constanţa 13, 95–98 (2005)
Mortici, C., Vernescu, A.: Some new facts in discrete asymptotic analysis. Math. Balk. 21, 301–308 (2007)
Vernescu, A.: The order of convergence of the sequence that defines the constant of Euler. Gaz. Mat., Ser. A. Buchar. 88, 380–381 (1983)
Young, R.M.: Euler’s constant. Math. Gaz. 75, 187–190 (1991)
DeTemple, D.W.: A quicker convergence to Euler’s constant. Am. Math. Mon. 100, 468–470 (1993)
DeTemple, D.W.: A geometric look at sequences that converge to Euler’s constant. Coll. Math. J. 37, 128–131 (2006)
Vernescu, A.: A new accelerate convergence to the constant of Euler. Gaz. Mat., Ser. A 104, 273–278 (1999)
Mortici, C.: Optimizing the rate of convergence in some new classes of sequences convergent to Euler’s constant. Anal. Appl. 8, 99–107 (2010)
Mortici, C.: A quicker convergence toward the γ constant with the logarithm term involving the constant e. Carpath. J. Math. 26, 86–91 (2010)
Lu, D., Song, L., Yu, Y.: A new quicker sequence convergent to Euler’s constant. J. Number Theory 147, 69–80 (2015)
Lu, D.: Some quicker classes of sequences convergent to Euler’s constant. Appl. Math. Comput. 232, 172–177 (2014)
Mortici, C.: Product approximations via asymptotic integration. Am. Math. Mon. 117, 434–441 (2010)
Mortici, C.: A new Stirling series as continued fraction. Number Algoritm. 56, 17–27 (2011)
Mortici, C.: A continued fraction approximation of the gamma function. J. Math. Anal. Appl. 402, 405–410 (2013)
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).
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
The authors contributed equally to this paper. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Jia, LJ., Ge, B., Liu, LL. et al. A series of sequences convergent to Euler’s constant. J Inequal Appl 2018, 136 (2018). https://doi.org/10.1186/s13660-018-1727-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-018-1727-6