Logarithm of Factorial
Jump to navigation
Jump to search
Theorem
\(\ds \ln n!\) | \(=\) | \(\ds \sum_{k \mathop \ge 0} a_{k + 1} n^{\underline k}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds a_1 n + a_2 n \paren {n - 1} + a_3 n \paren {n - 1} \paren {n - 2} + \cdots\) |
where:
- $\ds a_m = \dfrac {\paren {-1}^m} {m!} \sum_{k \mathop \ge 1} \paren {-1}^k \binom {m - 1} {k - 1} \ln k$
Proof
This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Historical Note
The sequence of $a_1, a_2, \ldots$ was established by James Stirling during the course of his attempt extend the factorial to the real numbers.
However, although he established that $\paren {\dfrac 1 2}! = \dfrac {\sqrt \pi} 2$, he was not able to prove that this sum defined $n!$ for a general non-integer $n$.
It was Charles Hermite who finally proved in $1900$ that this formula does indeed define $n!$, by demonstrating that it is identical to the Euler form of the Gamma function.
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.5$: Permutations and Factorials: $(12)$