Stirling Number of n with n-m is Polynomial in n of Degree 2m/Second Kind
Jump to navigation
Jump to search
This theorem requires a proof..
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
Let $m \in \Z_{\ge 0}$.
The Stirling number of the second kind $\displaystyle \left\{ {n \atop n - m}\right\}$ is a polynomial in $n$ of degree $2 m$.
Proof
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.6$: Binomial Coefficients
