# Stirling Number of n with n-m is Polynomial in n of Degree 2m/Second Kind

Jump to navigation
Jump to search

## Theorem

Let $m \in \Z_{\ge 0}$.

The Stirling number of the second kind $\ds {n \brace n - m}$ is a polynomial in $n$ of degree $2 m$.

## Proof

## Sources

- 1997: Donald E. Knuth:
*The Art of Computer Programming: Volume 1: Fundamental Algorithms*(3rd ed.) ... (previous) ... (next): $\S 1.2.6$: Binomial Coefficients