Related papers: An Elementary Proof of Stirling's Formula
Exactification is the process of obtaining exact values of a function from its complete asymptotic expansion. Here Stirling's approximation for the logarithm of the gamma function or $\ln \Gamma(z)$ is derived completely whereby it is…
This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…
An alternative form of Fermats equation[1] is proposed. It represents a portion of the identity that includes three terms of Fermats original equation. This alternative form permits an elementary and compact proof of the first case of…
We show some elementary facts about the semantical analogue of Parikh's Splitting, which we call Factorization.
Associated to each complex-valued random variable satisfying appropriate integrability conditions, we introduce a different generalization of the Stirling numbers of the second kind. Various equivalent definitions are provided. Attention,…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
When k > 1 and s is sufficiently large in terms of k, we derive an explicit multi-term asymptotic expansion for the number of representations of a large natural number as the sum of s positive integral k-th powers.
In this note, we derive an alternative recursive formula for the sums of powers of integers involving the Stirling numbers of the first kind. As a remarkable by-product, we provide a non-recursive definition of the Catalan numbers.
In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…
The classical Stirling's formula gives the asymptotic behavior of the gamma function. Katayama and Ohtsuki generalized this formula for Barnes' multiple gamma functions. In this paper, we further generalize these formulas for the multiple…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
We present a slightly more general version of Boole's additive formula for factorials as a simple consequence of Lagrange's Interpolating Polynomial theorem.
A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…
Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…
We present an astonishingly simple and elegant proof of the celebrated Basel problem.
Let K_n denote the smaller mode of the nth row of Stirling numbers of the second kind S(n, k). Using a probablistic argument, it is shown that for all n>=2, [exp(w(n))]-2<=K_n<=[exp(w(n))]+1, where [x] denotes the integer part of x, and…
This note presents a simple proof of the characteristic function of Student's $t$-distribution. The method of proof, which involves finding a differential equation satisfied by the characteristic function, is applicable to many other…
We make use of product integrals to provide an unambiguous mathematical representation of Wilson line and Wilson loop operators. Then, drawing upon various properties of product integrals, we discuss such properties of these operators as…
We show that a simple and straightforward rational approximation to the Thomas--Fermi equation provides the slope at origin with unprecedented accuracy. We compare present approach with other available ones.
We introduce the notion of $\alpha$-numbers and formal intercept of sturmian words, and derive from this study general factorisations formula for sturmian words. Sturmian words are defined as infinite words with lowest unbound complexity,…