I know that when $k > n$, $$\sum_{j = 0}^{n}{n \choose j}(-1)^{j}(n - j)^k$$

counts the number of onto functions $f : [k] \rightarrow [n]$. But I have no clue what this sum is when $k < n$. Any hints?


The inclusion-exclusion reasoning that says that


is the number of functions from $[k]$ onto $[n]$ is valid whether or not $k\ge n$, so it constitutes a combinatorial argument that the sum must be $0$ when $k<n$. As an example, when $n=3$ and $k=2$ we have



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.