Bourbaki

Corollary

Tag 08JG, permanent. Cite it as [Bourbaki, Tag 08JG].

Functions of a Real Variable, chapter VII, § 2. THE GAMMA FUNCTION IN THE COMPLEX DOMAIN

Along the filter F\mathfrak{F} one has

Γ(z)∼2πexp⁡(zlog⁡z−z−12log⁡z). \Gamma(z) \sim \sqrt{2\pi} \exp(z \log z - z - \frac{1}{2} \log z).

In particular, for xx real tending to +∞+\infty the formula (20) can be written

Γ(x)∼2π xx−1/2e−x, \Gamma(x) \sim \sqrt{2\pi} \, x^{x-1/2} e^{-x},

whence, as the integer nn tends to +∞+\infty,

n!∼2π nn+1/2 e−n n! \sim \sqrt{2\pi} \, n^{n+1/2} \, e^{-n}

(cf. V, p. 244).

One can deduce numerous formulae from this. For example, for every complex number α\alpha and every integer nn one has, as nn tends to +∞+\infty,

Γ(n+α)Γ(n)∼nα(=eαlog⁡n). \frac{\Gamma(n+\alpha)}{\Gamma(n)} \sim n^{\alpha} \quad (= e^{\alpha \log n}).

Similarly, for every complex number aa not an integer ⩽0\leqslant 0 one has

a(a+1)(a+2)…(a+n)=Γ(n+a+1)Γ(a)∼2πΓ(a) nn+a+1/2 en a(a+1)(a+2)\ldots(a+n) = \frac{\Gamma(n+a+1)}{\Gamma(a)} \sim \frac{\sqrt{2\pi}}{\Gamma(a)} \, n^{n+a+1/2} \, e^n

and for every complex number aa not an integer ⩾0\geqslant 0

(an)=(−1)nΓ(−a)Γ(n−a)Γ(n+1)∼(−1)nΓ(−a) n−a−1. \binom{a}{n} = \frac{(-1)^n}{\Gamma(-a)} \frac{\Gamma(n-a)}{\Gamma(n+1)} \sim \frac{(-1)^n}{\Gamma(-a)} \, n^{-a-1}.

Finally, for every real constant k>1k > 1 one has

(knn)=Γ(kn+1)Γ(n+1)Γ((k−1)n+1)∼k2π(k−1)n(kk(k−1)k−1)n. \binom{kn}{n} = \frac{\Gamma(kn+1)}{\Gamma(n+1) \Gamma((k-1)n+1)} \sim \sqrt{\frac{k}{2\pi(k-1)n}} \left( \frac{k^k}{(k-1)^{k-1}} \right)^n.

The same argument leads to the following analogous proposition:

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Transcribed from the printed volume. Not translated.