English
Related papers

Related papers: Approximation Of Logarithm, Factorial And Euler Ma…

200 papers

For any natural number $n\in\mathbb{N}$, $ \frac{1}{2n+\frac1{1-\gamma}-2}\le \sum_{i=1}^n\frac1i-\ln n-\gamma<\frac{1}{2n+\frac13}, $ where $\gamma=0.57721566490153286...m$ denotes Euler's constant. The constants $\frac{1}{1-\gamma}-2$ and…

Classical Analysis and ODEs · Mathematics 2012-08-21 Chao-Ping Chen , Feng Qi

In this paper, we present two new generalizations of the Euler-Mascheroni constant arising from the Dirichlet series associated to the hyperharmonic numbers. We also give some inequalities related to upper and lower estimates, and…

Number Theory · Mathematics 2021-09-06 Mümün Can , Ayhan Dil , Levent Kargın , Mehmet Cenkci , Mutlu Güloğlu

In this paper, we continue to study properties of rational approximations to Euler's constant and values of the Gamma function defined by linear recurrences, which were found recently by A. I. Aptekarev and T. Rivoal. Using multiple…

Number Theory · Mathematics 2012-06-21 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood

Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that…

History and Overview · Mathematics 2019-12-10 David J. Pengelley

Following earlier results of Sondow, we propose another criterion of irrationality for Euler's constant $\gamma$. It involves similar linear combinations of logarithm numbers $L\_{n,m}$. To prove that $\gamma$ is irrational, it suffices to…

Number Theory · Mathematics 2009-10-06 Marc Prévost

We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…

Data Structures and Algorithms · Computer Science 2026-04-29 Michał Szyfelbein

The harmonic numbers are the sequence 1, 1+1/2, 1+1/2+1/3, ... Their asymptotic difference from the sequence of the natural logarithm of the positive integers is Euler's constant gamma. We define a family of natural generalizations of the…

Number Theory · Mathematics 2023-04-12 J Marshall Ash , Michael Ash , Rafael Ash , Ángel Plaza

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

Number Theory · Mathematics 2021-11-15 Andreas Weingartner

Let $b \ge 2$ be an integer and $\xi$ an irrational real number. We prove that, if the irrationality exponent of $\xi$ is equal to $2$ or slightly greater than $2$, then the $b$-ary expansion of $\xi$ cannot be `too simple', in a suitable…

Number Theory · Mathematics 2015-10-02 Yann Bugeaud , Dong Han Kim

Recently, A. I. Aptekarev and his collaborators found a sequence of rational approximations to Euler's constant $\gamma$ defined by a third-order homogeneous linear recurrence. In this paper, we give a new interpretation of Aptekarev's…

Number Theory · Mathematics 2013-12-31 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood

Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…

Numerical Analysis · Mathematics 2025-11-25 Narinder Kumar Wadhawan

In this paper we consider some rational approximations to the fractional powers of self-adjoint positive operators, arising from the Gauss-Laguerre rules. We derive practical error estimates that can be used to select a priori the number of…

Numerical Analysis · Mathematics 2024-03-19 Lidia Aceto , Paolo Novati

The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…

Mathematical Physics · Physics 2009-11-13 V. I. Yukalov , E. P. Yukalova

Translated from the Latin original "Evolutio producti infiniti $(1-x)(1-xx)(1-x^3)(1x^4)(1-x^5)(1-x^6)$ etc. in seriem simplicem" (1775). E541 in the Enestroem index. In this paper Euler is revisiting his proof of the pentagonal number…

History and Overview · Mathematics 2009-08-31 Leonhard Euler , Jordan Bell

It is known that a subharmonic function of finite order $\rho$ can be approximated by the logarithm of the modulus of an entire function at the point $z$ outside an exceptional set up to $C\log|z|$. In this article we prove that if such an…

Complex Variables · Mathematics 2007-10-03 Markiyan Hirnyk

By using the strong approximation, this paper establishes several limit results on the convergent rate of a infinite series of probabilities on the other law of iterated logarithm.

Probability · Mathematics 2007-05-23 Li-Xin Zhang

We describe an expansion of Legendre polynomials, analogous to the Taylor expansion, to approximate arbitrary functions. We show that the polynomial coefficients in Legendre expansion, therefore the whole series, converge to zero much more…

Numerical Analysis · Mathematics 2012-03-13 Michael A. Cohen , Can Ozan Tan

We present the singular Euler--Maclaurin expansion, a new method for the efficient computation of large singular sums that appear in long-range interacting systems in condensed matter and quantum physics. In contrast to the traditional…

Numerical Analysis · Mathematics 2022-01-28 Andreas A. Buchheit , Torsten Keßler

In this paper, we evaluate in closed form several different series involving the harmonic numbers and skew-harmonic numbers. We consider two classes of series involving these sequences. One class of series involves the product of the $n$th…

Classical Analysis and ODEs · Mathematics 2025-10-20 Vincent Nguyen

We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…

Number Theory · Mathematics 2020-09-14 Roger Baker