A series of sequences convergent to Euler’s constant

Li-Jiang Jia, Bin Ge, Lili Liu, Ran YiJournal of Inequalities and Applications 2018 · DOI

TL;DR

This paper introduces a novel sequence that converges to Euler's constant ($\gamma$) at a significantly faster rate than previously known methods. By leveraging continued fractions, the authors provide a more efficient way to approximate this fundamental mathematical constant, which has broad applications across various scientific disciplines.

What Problem Does This Paper Address?

Euler's constant, denoted by $\gamma$, is a fundamental mathematical constant that appears in numerous areas of mathematics, including analysis, number theory, and probability. It is defined as the limit of a specific sequence, but this convergence is relatively slow. For decades, mathematicians have sought to develop sequences that converge to $\gamma$ more rapidly, aiming to improve the efficiency of approximations and calculations involving this constant. Previous research has introduced various sequences with improved convergence rates, often achieving $n^{-2}$ or $n^{-3}$ convergence. However, the quest for even faster convergence and simpler forms continues, as demonstrated by the ongoing efforts to refine these approximations. This paper directly addresses this challenge by proposing a new sequence that surpasses existing methods in terms of convergence speed.

Methods

The core of this paper's contribution lies in its novel approach to constructing sequences that converge to Euler's constant. The authors utilize continued fractions as a primary tool to derive their new sequences. This technique allows them to build approximations with enhanced asymptotic behavior. They then analyze these sequences by examining their asymptotic expansions, which provide detailed information about how the error term behaves as the sequence index $n$ approaches infinity.

The paper introduces a general form for these sequences, parameterized by $a$ and $b$, denoted as $N_{n,a,b}$. By carefully selecting specific values for $a$ and $b$, they can achieve different convergence rates. The authors also extend this framework to introduce more complex sequences, denoted as $y_{n,k,a,b}^{(s)}$, which involve additional parameters ($k$ and $s$) and are designed to achieve even higher orders of convergence, up to $n^{-5}$. The proofs of their results rely on Taylor series expansions and careful algebraic manipulation of the error terms.

Datasets

Not discussed in the paper. The paper focuses on theoretical advancements in approximating a mathematical constant rather than empirical evaluation on datasets.

Key Insights and Ideas

  • Continued Fractions as a Powerful Tool: The paper highlights the effectiveness of continued fractions in generating sequences with superior convergence properties for fundamental constants like Euler's constant.
  • Systematic Improvement of Convergence: The authors demonstrate a systematic way to construct sequences with increasingly faster convergence rates by introducing parameters and analyzing their asymptotic behavior. They show how to achieve $n^{-1}$, $n^{-2}$, $n^{-3}$, $n^{-4}$, and even $n^{-5}$ convergence.
  • Trade-off Between Simplicity and Speed: While simpler sequences like $N_{n,a,b}$ are easier to grasp, the more complex sequences like $y_{n,k,a,b}^{(s)}$ are necessary to achieve the highest convergence rates.
  • The "Fastest Possible" Sequence: The paper identifies specific conditions on the parameters ($a$, $b$, and $k$) that lead to the "fastest possible" convergence for a given order, offering a theoretical benchmark.

Key Results

The paper presents several key results:

  • New Convergent Sequences: The authors introduce new sequences, such as $N_{n,a,b}$ and $y_{n,k,a,b}^{(s)}$, that converge to Euler's constant.
  • Superior Convergence Rates: They demonstrate that their new sequences converge significantly faster than previously known sequences, including those by DeTemple, Mortici, Vernescu, and Lu. For instance, they show how to achieve convergence rates of $n^{-1}$, $n^{-2}$, $n^{-3}$, $n^{-4}$, and $n^{-5}$.
  • Specific Parameter Choices for Optimal Convergence: The paper provides explicit conditions on the parameters ($a, b, k, s$) that yield the fastest convergence for each order. For example, for $n^{-2}$ convergence, specific values of $a$ and $b$ are identified. For $n^{-3}$ convergence, specific values of $a, b, k$ are found.
  • Quantitative Bounds: The paper provides explicit bounds and limit expressions for the error terms of their sequences, quantifying their convergence speed. For example, they show that for certain parameter choices, $\lim_{n \to \infty} n^3 (N_{n,a,b} - \gamma) = \frac{1}{24}$.

Limitations and Future Work

  • Complexity of Higher-Order Sequences: While the paper achieves very high convergence rates (up to $n^{-5}$), the formulas for the parameters and the sequences themselves become increasingly complex as the order of convergence increases. This might limit their practical applicability for extremely high precision requirements where computational cost becomes a factor.
  • Theoretical Focus: The paper is primarily theoretical, focusing on the mathematical derivation and analysis of these sequences. Further work could explore the practical implementation and computational advantages of these sequences in numerical algorithms.
  • Generalization: The authors have focused on Euler's constant. It would be interesting to see if similar techniques using continued fractions could be applied to accelerate the convergence of sequences approximating other fundamental mathematical constants.

Summary updated

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.
BibTeX
@article{jia2018series,
  author = {Li-Jiang Jia and Bin Ge and Lili Liu and Ran Yi},
  title = {{A series of sequences convergent to Euler’s constant}},
  journal = {Journal of Inequalities and Applications},
  year = {2018},
  doi = {10.1186/s13660-018-1727-6},
}

Loading related content...

Figure