Related papers: Stirling's Series Revisited
Applying a theorem of Howard for a formula recently proved by Brassesco and M\'endez, we derive new simple explicit formulas for the coefficients of the asymptotic expansion to the sequence of factorials. To our knowledge no explicit…
We obtain an explicit simple formula for the coefficients of the asymptotic expansion for the factorial of a natural number,in terms of derivatives of powers of an elementary function. The unique explicit expression for the coefficients…
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 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…
We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…
The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…
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…
Let $f$ be a real-valued function of a single variable such that it is positive over the primes. In this article, we construct a factorial, $n!_f$, associated to $f$, called the associated Legendre formula, or $f$-factorial, and show,…
For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…
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.…
This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…
We present an asymptotic evaluation unitary formula for large argument values existing for defined class of functions. The asymptotic evaluation is obtained using only power series expansion coefficients of a function, what is a new result…
We discuss the asymptotic expansions of certain products of Bernoulli numbers and factorials, e.g., \[ \prod_{\nu=1}^n |B_{2\nu}| \quad \text{and} \quad \prod_{\nu=1}^n (k \nu)!^{\nu^r} \quad \text{as} \quad n \to \infty \] for integers $k…
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 introduce a Dirichlet-series framework for studying the asymptotic behavior of generalized factorial functions defined by Legendre-type valuation formulas. Let $K$ be a number field and let $S$ be a finite set of prime ideals. For a…
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…
Asymptotic expansions for a wide class of distribution are studied. A simple method for computation of the series coefficients is suggested. The case when regularization parameter of the distribution depends on the asymptotic parameter is…
A novel method of asymptotic factorization of $n \times n$ matrix functions is proposed. Considered class of matrices is motivated by certain problems originated in the elasticity theory. An example is constructed to illustrate…
A conjectured relation between Ramanujan's asymptotic approximations to the exponential function and the exponential integral is established. The proof involves Stirling numbers, second-order Eulerian numbers, modifications of both of…
It is derived the explicit asymptotic expression in $n$ for the coefficient $c_n$ of the generating function for multiplicative structures with sub exponential rate of growth of $c_n,$ as $n\to\infty$.