# Definition:Stirling Numbers of the First Kind/Unsigned/Complex Numbers

Jump to navigation
Jump to search

## Definition

Donald E. Knuth, in his *The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd ed.* of $1997$, suggests an extension of the **unsigned Stirling numbers of the first kind** $\ds {r \brack r - m}$ to the real and complex numbers.

However, beyond stating that such a number is a polynomial in $r$ of degree $2 m$, and providing a few examples, he goes no further than that, and the details of this extension are unclear.

This page needs the help of a knowledgeable authority.If you are knowledgeable in this area, then you can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues.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 `{{Help}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |

## Sources

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