Abstract
In this paper, we provide a new sequence converging to the Euler–Mascheroni constant. Finally, we establish some inequalities for the Euler–Mascheroni constant by the new sequence.
Similar content being viewed by others
1 Introduction
The Euler–Mascheroni constant was first introduced by Leonhard Euler (1707–1783) in 1734 as the limit of the sequence
There are many famous unsolved problems about the nature of this constant (see, e.g., the survey papers or books of Brent and Zimmermann [1], Dence and Dence [2], Havil [3], and Lagarias [4]). For example, it is a long-standing open problem if the Euler–Mascheroni constant is a rational number. A good part of its mystery comes from the fact that the known algorithms converging to γ are not very fast, at least when they are compared to similar algorithms for π and e.
The sequence \((\gamma(n) )_{n\in\mathbb{N}}\) converges very slowly toward γ, like \((2n)^{-1}\). Up to now, many authors are preoccupied to improve its rate of convergence; see, for example, [2, 5–14] and references therein. We list some main results:
Recently, Mortici and Chen [14] provided a very interesting sequence
and proved that
Hence the rate of the convergence of the sequence \((\nu(n) )_{n\in\mathbb{N}}\) is \(n^{-12}\).
Very recently, by inserting the continued fraction term into (1.1), Lu [9] introduced a class of sequences \((r_{k}(n) )_{n\in\mathbb{N}}\) (see Theorem 1) and showed that
In fact, Lu [9] also found \(a_{4}\) without proof, and his works motivate our study. In this paper, starting from the well-known sequence \(\gamma_{n}\), based on the early works of Mortici, DeTemple, and Lu, we provide some new classes of convergent sequences for the Euler–Mascheroni constant.
Theorem 1
For the Euler–Mascheroni constant, we have the following convergent sequence:
where
Let
For \(1\le k\le7\), we have
where
Furthermore, for \(r_{2}(n)\) and \(r_{3}(n)\), we also have the following inequalities.
Theorem 2
Let \(r_{2}(n)\) and \(r_{3}(n)\) be as in Theorem 1. Then
Remark 1
Certainly, there are similar inequalities for \(r_{k}(n)\) (\(1\le k\le7\)); we omit the details.
2 Proof of Theorem 1
The following lemma gives a method for measuring the rate of convergence. This lemma was first used by Mortici [15, 16] for constructing asymptotic expansions or accelerating some convergences. For a proof and other details, see, for example, [16].
Lemma 1
If the sequence \((x_{n})_{n\in\mathbb{N}}\) converges to zero and there exists the limit
with \(s>1\), then there exists the limit
We need to find the value \(a_{1}\in\mathbb{R}\) that produces the most accurate approximation of the form
To measure the accuracy of this approximation, we usually say that an approximation (2.3) is better as \(r_{1}(n) -\gamma\) faster converges to zero. Clearly,
Developing expression (2.4) into a power series expansion in \(1/n\), we obtain
From Lemma 1 we see that the rate of convergence of the sequence \((r_{1}(n)-\gamma )_{n\in\mathbb{N}}\) is even higher as the value s satisfies (2.1). By Lemma 1 we have
(i) If \(a_{1}\neq1/2\), then the rate of convergence of the \((r_{1}(n)-\gamma )_{n\in\mathbb{N}}\) is \(n^{-2}\), since
(ii) If \(a_{1}= 1/2\), then from (2.5) we have
Hence the rate of convergence of the \((r_{1}(n)-\gamma )_{n\in\mathbb{N}}\) is \(n^{-3}\), since
We also observe that the fastest possible sequence \((r_{1}(n) )_{n\in\mathbb{N}}\) is obtained only for \(a_{1}=1/2\).
We repeat our approach to determine \(a_{1}\) to \(a_{7}\) step by step. In fact, we can easily compute \(a_{k}\), \(k\leq15\), by the Mathematica software. In this paper, we use the Mathematica software to manipulate symbolic computations.
Let
Then
Hence the key step is to expand \(r_{k}(n)-r_{k}(n+1)\) into power series in \(1/n\). Here we use some examples to explain our method.
Step 1: For example, given \(a_{1}\) to \(a_{4}\), find \(a_{5}\). Define
By using the Mathematica software (the Mathematica Program is very similar to that given further in Remark 2; however, it has the parameter \(a_{8}\)) we obtain
The fastest possible sequence \((r_{5}(n) )_{n\in\mathbb{N}}\) is obtained only for \(a_{5}=-\frac{1}{160}\). At the same time, it follows from (2.8) that
The rate of convergence of \((r_{8}(n)-\gamma )_{n\in\mathbb{N}}\) is \(n^{-7}\), since
We can use this approach to find \(a_{k}\) (\(1\le k\le15\)). From the computations we may the conjecture \(a_{n+1}=C_{n}\), \(n\geq1\). Now, let us check it carefully.
Step 2: Check \(a_{6}=-\frac{151}{290\text{,}304}\) to \(a_{7}=-\frac{1}{896}\).
Let \(a_{1},\dots, a_{6}\), and \(r_{6}(n)\) be defined as in Theorem 1. Applying the Mathematica software, we obtain
The rate of convergence of \((r_{6}(n)-\gamma )_{n\in\mathbb{N}}\) is \(n^{-8}\), since
Finally, we check that \(a_{7}=-\frac{1}{896}\):
Since \(a_{7}=-\frac{1}{896}\) and
the rate of convergence of the \((r_{7}(n)-\gamma )_{n\in\mathbb{N}}\) is \(n^{-9}\).
This completes the proof of Theorem 1.
Remark 2
From the computations we can guess that \(a_{n+1}=C_{n}\), \(n\geq1\). It is a very interesting problem to prove this. However, it seems impossible by the provided method.
3 Proof of Theorem 2
Before we prove Theorem 2, let us give a simple inequality, which follows from the Hermite–Hadamard inequality and plays an important role in the proof.
Lemma 2
Let f be a twice continuously differentiable function. If \(f''(x)>0\), then
By \(P_{k}(x)\) we denote polynomials of degree k in x such that all its nonzero coefficients are positive; it may be different at each occurrence.
Let us prove Theorem 2. Noting that \(r_{2}(\infty)=0\), we easily see that
where
Let \(D_{1}=1/2\). By using the Mathematica software we have
and
Hence, we get the following inequalities for \(x\ge1\):
Since \(f(\infty)=0\), from the right-hand side of (3.3) and Lemma 2 we get
From (3.1) and (3.4) we obtain
Similarly, we also have
and
Combining (3.5) and (3.6) completes the proof of (1.6).
Noting that \(r_{3}(\infty)=0\), we easily deduce
where
Let \(D_{2}=\frac{143}{288}\). By using the Mathematica software we have
and
Hence, for \(x\ge4\),
Since \(g(\infty)=0\), by (3.8) we get
It follows from (3.7), (3.9), and Lemma 2 that
Finally,
and
References
Brent, R.P., Zimmermann, P.: Modern Computer Arithmetic. Cambridge Monographs on Applied and Computational Mathematics, vol. 18. Cambridge University Press, Cambridge (2011). pp. xvi+221
Dence, T.P., Dence, J.B.: A survey of Euler’s constant. Math. Mag. 82, 255–265 (2009)
Havil, J.: Gamma: Exploring Euler’s Constant. Princeton University Press, Princeton (2003)
Lagarias, J.C.: Euler’s constant: Euler’s work and modern developments. Bull. Am. Math. Soc. (N.S.) 50(4), 527–628 (2013)
Chen, C.P., Mortici, C.: New sequence converging towards the Euler–Mascheroni constant. Comput. Math. Appl. 64, 391–398 (2012)
DeTemple, D.W.: A quicker convergence to Euler’s constant. Am. Math. Mon. 100(5), 468–470 (1993)
Gavrea, I., Ivan, M.: Optimal rate of convergence for sequences of a prescribed form. J. Math. Anal. Appl. 402(1), 35–43 (2013)
Gourdon, X., Sebah, P.: Collection of formulae for the Euler constant. http://numbers.computation.free.fr/Constants/Gamma/gammaFormulas.pdf, or see http://numbers.computation.free.fr/Constants/constants.html
Dawei, L.: A new quiker sequence convergent to Euler’s constant. J. Number Theory 136, 320–329 (2014)
Dawei, L.: Some quicker classes of sequences convergent to Euler’s constant. Appl. Math. Comput. 232, 172–177 (2014)
Dawei, L.: Some new convergent sequences and inequalities of Euler’s constant. J. Math. Anal. Appl. 419(1), 541–552 (2014)
Dawei, L.: Some new improved classes of convergence towards Euler’s constant. Appl. Math. Comput. 243, 24–32 (2014)
Mortici, C.: On new sequences converging towards the Euler–Mascheroni constant. Comput. Math. Appl. 59(8), 2610–2614 (2010)
Mortici, C., Chen, C.P.: On the harmonic number expansion by Ramanujan. J. Inequal. Appl. 2013 222 (2013)
Mortici, C.: Product approximations via asymptotic integration. Am. Math. Mon. 117(5), 434–441 (2010)
Mortici, C.: New approximations of the gamma function in terms of the digamma function. Appl. Math. Lett. 23, 97–100 (2010)
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant Nos. 11571267, 61403034, and 91538112) and Beijing Municipal Commission of Education Science and Technology Program KM201810017009. Computations made in this paper were performed using Mathematica 9.0.
Author information
Authors and Affiliations
Contributions
The 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
You, X., Chen, DR. A new sequence convergent to Euler–Mascheroni constant. J Inequal Appl 2018, 75 (2018). https://doi.org/10.1186/s13660-018-1670-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-018-1670-6