- Research
- Open Access
Monotone and fast computation of Euler’s constant
- José A Adell†^{1}Email author and
- Alberto Lekuona†^{1}
https://doi.org/10.1186/s13660-017-1507-8
© The Author(s) 2017
- Received: 3 May 2017
- Accepted: 30 August 2017
- Published: 15 September 2017
Abstract
We construct sequences of finite sums \((\tilde{l}_{n})_{n\geq 0}\) and \((\tilde{u}_{n})_{n\geq 0}\) converging increasingly and decreasingly, respectively, to the Euler-Mascheroni constant γ at the geometric rate 1/2. Such sequences are easy to compute and satisfy complete monotonicity-type properties. As a consequence, we obtain an infinite product representation for \(2^{\gamma }\) converging in a monotone and fast way at the same time. We use a probabilistic approach based on a differentiation formula for the gamma process.
Keywords
- Euler-Mascheroni constant
- fast computation
- infinite product
- alternating zeta function
- gamma process
MSC
- 11M35
- 33F05
- 60E05
1 Introduction
As far as we know, two main types of computations of the Euler constant have been developed. The first one emphasizes the monotonicity of the corresponding convergent sequences, but the rates of convergence are relatively slow (polynomial rates). The second one emphasizes the speed of convergence (geometric rates), but looses the monotonicity in the approximation.
In this paper, we gather both points of view by providing approximating sequences that converge at the geometric rate 1/2 and satisfy complete monotonicity-type properties (monotonicity, convexity, etc.). In addition, such approximating sequences are easy to compute.
We point out that some authors have introduced probabilistic tools to deal with different topics of analytic number theory. For instance, Sun [12] described Stirling series in terms of products of uniformly distributed random variables, Srivastava and Vignat [13] have given representations of the Bernoulli, Euler, and Gegenbauer polynomials in terms of moments of appropriate random variables, and Ta [14] has recently introduced a nice probabilistic approach to study Appell polynomials by connecting them to moments of random variables. Finally, fast computations of the Stieltjes constants using differentiation formulas for linear operators represented by stochastic processes can be found in [15] and the references therein.
2 Main results
Theorem 2.1
The approximating sequences to γ given in (2) and (3) are simpler to compute than those in Theorem 2.1. However, the sequences \((\tilde{l}_{n})_{n\geq 0}\) and \((\tilde{u}_{n})_{n\geq 0}\) in this theorem converge to γ in a much faster way and enjoy properties such as monotonicity, convexity, and so on. On the other hand, formulas (4), (5), (6), and (7) provide fast computations of γ at the price of loosing the monotonicity of the corresponding approximating sequences. Certainly, formula (7) computes γ in a faster way than that in (13). However, the sequences \((\tilde{l}_{n})_{n\geq 0}\) and \((\tilde{u}_{n})_{n\geq 0}\) in Theorem 2.1 are easier to compute than the main term in (7).
Corollary 2.2
3 Auxiliary results
This formula can be applied to the problem at hand as follows.
Lemma 3.1
Proof
Lemma 3.2
Proof
Thanks to Lemma 3.2, the complete monotonicity-type properties of \((l_{n})_{n\geq 0}\) and \((u_{n})_{n\geq 0}\) are easily derived from the analogous properties satisfied by the sequences of functions \((L_{n}(x))_{n\geq 0}\) and \((U_{n}(x))_{n\geq 0}\).
Lemma 3.3
Proof
4 The proofs
Proof of Theorem 2.1
Proof of Corollary 2.2
Notes
Declarations
Acknowledgements
The authors are partially supported by Research Projects DGA (E-64), MTM2015-67006-P, and by FEDER funds.
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.
Authors’ Affiliations
References
- Lagarias, JC: Euler’s constant: Euler’s work and modern developments. Bull. Am. Math. Soc. (N.S.) 50(4), 527-628 (2013). doi:10.1090/S0273-0979-2013-01423-X MathSciNetView ArticleMATHGoogle Scholar
- Xu, H, You, X: Continued fraction inequalities for the Euler-Mascheroni constant. J. Inequal. Appl. 2014, Article ID 343 (2014). doi:10.1186/1029-242X-2014-343 MathSciNetView ArticleMATHGoogle Scholar
- Lu, D, Song, L, Yu, Y: Some new continued fraction approximation of Euler’s constant. J. Number Theory 147, 69-80 (2015). doi:10.1016/j.jnt.2014.07.002 MathSciNetView ArticleMATHGoogle Scholar
- Lu, D, Song, L, Yu, Y: Some quicker continued fraction approximations and inequalities towards Euler’s constant. J. Number Theory 175, 100-116 (2017). doi:10.1016/j.jnt.2016.11.024 MathSciNetView ArticleMATHGoogle Scholar
- Yang, S: On an open problem of Chen and Mortici concerning the Euler-Mascheroni constant. J. Math. Anal. Appl. 396(2), 689-693 (2012). doi:10.1016/j.jmaa.2012.07.007 MathSciNetView ArticleMATHGoogle Scholar
- Chen, C-P, Mortici, C: New sequence converging towards the Euler-Mascheroni constant. Comput. Math. Appl. 64(4), 391-398 (2012). doi:10.1016/j.camwa.2011.03.099 MathSciNetView ArticleMATHGoogle Scholar
- Hessami Pilehrood, Kh, Hessami Pilehrood, T: On a continued fraction expansion for Euler’s constant. J. Number Theory 133(2), 769-786 (2013). doi:10.1016/j.jnt.2012.08.016 MathSciNetView ArticleMATHGoogle Scholar
- Karatsuba, EA: On the computation of the Euler constant γ. Numer. Algorithms 24(1-2), 83-97 (2000). doi:10.1023/A:1019137125281 MathSciNetView ArticleMATHGoogle Scholar
- Coffey, MW: The Stieltjes constants, their relation to the \(\eta_{j}\) coefficients, and representation of the Hurwitz zeta function. Analysis 30(4), 383-409 (2010). doi:10.1524/anly.2010.1048 MathSciNetView ArticleMATHGoogle Scholar
- Sondow, J: Criteria for irrationality of Euler’s constant. Proc. Am. Math. Soc. 131(11), 3335-3344 (2003). doi:10.1090/S0002-9939-03-07081-3 MathSciNetView ArticleMATHGoogle Scholar
- Zhang, NY, Williams, KS: Some results on the generalized Stieltjes constants. Analysis 14(2-3), 147-162 (1994) MathSciNetMATHGoogle Scholar
- Sun, P: Product of uniform distribution and Stirling numbers of the first kind. Acta Math. Sin. Engl. Ser. 21(6), 1435-1442 (2005). doi:10.1007/s10114-005-0631-4 MathSciNetView ArticleMATHGoogle Scholar
- Srivastava, HM, Vignat, C: Probabilistic proofs of some relationships between the Bernoulli and Euler polynomials. Eur. J. Pure Appl. Math. 5(2), 97-107 (2012) MathSciNetMATHGoogle Scholar
- Ta, BQ: Probabilistic approach to Appell polynomials. Expo. Math. 33(3), 269-294 (2015). doi:10.1016/j.exmath.2014.07.003 MathSciNetView ArticleMATHGoogle Scholar
- Adell, JA: Estimates of generalized Stieltjes constants with a quasi-geometric rate of decay. Proc. R. Soc., Math. Phys. Eng. Sci. 468(2141), 1356-1370 (2012). doi:10.1098/rspa.2011.0551 MathSciNetView ArticleMATHGoogle Scholar
- Guillera, J, Sondow, J: Double integrals and infinite products for some classical constants via analytic continuations of Lerch’s transcendent. Ramanujan J. 16(3), 247-270 (2008). doi:10.1007/s11139-007-9102-0 MathSciNetView ArticleMATHGoogle Scholar
- Çınlar, E: Probability and Stochastics. Graduate Texts in Mathematics, vol. 261, p. xiv+557. Springer, Berlin (2011). doi:10.1007/978-0-387-87859-1. MATHGoogle Scholar
- Adell, JA: Differential calculus for linear operators represented by finite signed measures and applications. Acta Math. Hung. 138(1-2), 44-82 (2013). doi:10.1007/s10474-012-0230-7 MathSciNetView ArticleMATHGoogle Scholar