LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Monotone and fast computation of Euler’s constant

Photo from archive.org

We construct sequences of finite sums (l˜n)n≥0$(\tilde{l}_{n})_{n\geq 0}$ and (u˜n)n≥0$(\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… Click to show full abstract

We construct sequences of finite sums (l˜n)n≥0$(\tilde{l}_{n})_{n\geq 0}$ and (u˜n)n≥0$(\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γ$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: fast computation; monotone fast; computation euler; euler constant

Journal Title: Journal of Inequalities and Applications
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.