相关论文: Original proofs of Stirling's series for log(n!)

We give an apparently new proof of Stirling's original asymptotic formula for the behavior of $\ln z!$ for large $z$. Stirling's original formula is not the formula widely known as "Stirling's formula", which was actually due to De Moivre.…

We present details of logically simplest integral sufficient for deducing the Stirling asymptotic formula for n!. It is the Newton integral, defined as the difference of values of any primitive at the endpoints of the integration interval.…

We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…

The Stirling approximation formula for $n!$ dates from 1730. Here we give new and instructive proofs of this and related approximation formulae via tools of probability and statistics. There are connections to the Central Limit Theorem and…

In 1730 James Stirling, building on the work of Abraham de Moivre, published what is known as Stirling's approximation of $n!$. He gave a good formula which is asymptotic to $n!$. Since then hundreds of papers have given alternative proofs…

Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…

A concise and elementary derivation of the complete asymptotic expansion for the factorial function $n!$ is presented. This treatment produces a new expression for the coefficients, and it brings to light the simple relationship between the…

It is known that the $S(n,k)$ Stirling numbers as well as the ordered Stirling numbers $k!S(n,k)$ form log-concave sequences. Although in the first case there are many estimations about the mode, for the ordered Stirling numbers such…

We present the history and previous approaches to the proof of Stirling's series. We use a different procedure, based on the asymptotic analysis of the difference equation $\Gamma(z+1)=z\Gamma(z)$. The method reproduces Stirling's series…

Stirling's formula, the asymptotic expansion of $n!$ for $n$ large, or of $\Gamma(z)$ for $z\to \infty$, is derived directly from the recursion equation $\Gamma(z+1) =z \Gamma(s)$ and the normalization condition $\Gamma ({1/2})…

We construct a new parametrization of double sequences $\{A_{n,k}(s)\}_{n,k}$ between $A_{n,k}(0)= \binom{n-1}{k-1}$ and $A_{n,k}(1)= \frac{1}{n!}\stirl{n}{k}$, where $\stirl{n}{k}$ are the unsigned Stirling numbers of the first kind. For…

We present a survey on recent results about Stirling's formula. More exactly, we reffer to a method using a form of Cesaro-Stolz lemma firstly introduced in [C. Mortici Product approximations via asymptotic integration Amer. Math. Monthly…

We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $\pi(x)$ of primes less than $x$ is…

A formula on Stirling numbers of the second kind $S(n, k)$ is proved. As a corollary, for odd $n$ and even $k$, it is shown that $k!S(n, k)$ is a positive multiple of the greatest common divisor of $j!S(n, j)$ for $k+1\leq j\leq n$. Also,…

In 1655, John Wallis whilst at the University of Oxford discovered the famous and beautiful formula for pi, now known as Wallis' Product. Since then, several analogous formulae have been discovered generalising the original. One more modern…

This is a historical introduction to the theory of Stirling numbers of the second kind S(n,k) from the point of view of analysis. We tell the story of their birth in the book of James Stirling (1730) and show how they mature in the works of…

We derive two-sided bounds for a class of Stirling-type asymptotic formulas for piecewise logarithmic interpolations of the pi function, and hence also for the factorials and the gamma functions. The bounds are derived by first proving some…

In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…

This paper presents a family of rapidly convergent summation formulas for various finite sums of analytic functions. These summation formulas are obtained by applying a series acceleration transformation involving Stirling numbers of the…

We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…