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

We introduce and prove several new formulas for the Euler-Mascheroni Constant. This is done through the introduction of the defined E-Harmonic function, whose properties, in this paper, lead to two novel formulas, alongside a family of…

In this work, we present a review and an example on some latter results on the problem of approximating the Euler-Mascheroni constant. We use the method firstly introduced in [C. Mortici, Product Approximations via Asymptotic Integration…

In this paper we present a method to derive Eulerian continued fractions arising from a sequence of integrals. As examples, through a new derivation, we reproduce classical continued fraction expansions for the natural logarithm, the…

We study the polynomial approximation problem in $L^2(\mu_1)$ where $\mu_1(dx) = e^{-|x|}/2 dx$. We show that for any absolutely continuous function $f$, $$ \sum_{k=1}^{\infty} \log^2(e+k) \langle f, P_k \rangle^2 \ \leq C \left(…

Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…

Translation from the Latin original, "Inventio summae cuiusque seriei ex dato termino generali" (1735). E47 in the Enestrom index. In this paper Euler derives the Euler-Maclaurin summation formula, by expressing y(x-1) with the Taylor…

In \cite{d4}, we gave a method to construct a continued fraction of the function $F(x):=e^{x}E_{1}(x)$. More precisely we define $F_{1}(x)$ as the reciprocal of $F(x)$ and we inductively define $F_{m}(x)$ as the reciprocal of ``$F_{m-1}(x)$…

We prove that the logarithm of the permanent of an nxn real matrix A and the logarithm of the hafnian of a 2nx2n real symmetric matrix A can be approximated within an additive error 1 > epsilon > 0 by a polynomial p in the entries of A of…

In 2007, A.I.Aptekarev and his collaborators discovered a sequence of rational approximations to Euler's constant $\gamma$ defined by a linear recurrence. In this paper, we generalize this result and present an explicit construction of…

Theorem 1 Let F:N-->R stand for any function which a) $F$ monotonically weakly increases; b) $F$ tends to infinity; and c) such that $q/F(q)$ tends to infinity. Let Z_F(q) equal the number of divisors of q less than sqrt{F(q)} minus the…

The main aim of this paper is to further develop a multiple-correction method formulated in a previous work~\cite{CXY}. As its applications, we find a kind of hybrid-type finite continued fraction approximations in two cases of Landau…

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

We construct new rational approximants of Euler's constant that improve those of Aptekarev et al. (2007) and Rivoal (2009). The approximants are given in terms of certain (mixed type) multiple orthogonal polynomials associated with the…

We obtain two sequences of rational numbers which converge to the Euler-Gompertz constant. Denote by <f(x)> the integral of f(x)e^{-x} from 0 to infinity. Recall that the Euler-Gompertz constant \delta is <ln(x+1)>. Main idea. Let P_n(x) be…

Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative…

We present efficient approximation of the error function obtained by Fourier expansion of the exponential function $\exp [{- {(t - 2 \sigma)^2}/4}]$. The error analysis reveals that it is highly accurate and can generate numbers that match…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

The Euler-Mascheroni constant is calculated by three novel representations over these sets respectively: 1) Tur\'an moments, 2) coefficients of Jensen polynomials for the Taylor series of the Riemann Xi function at s=1/2+i.t and 3) even…