Exercise · ZW-STIRLING-NUMBER-OF-THE-FIRST-KIND-003 · ★☆☆ Basic

What is \(c(n,n)\) for every \(n\ge 1\)?

Choose one option.

Show answer
  • A. 1

Explanation

Only the identity permutation has \(n\) cycles, since every element is a fixed point.

Study Enumerative combinatorics in ZWMath →

Review the concept: Stirling number of the first kind

The Stirling number of the first kind \(c(n,k)\) counts the permutations of \(n\) elements that have exactly \(k\) cycles.

\[x(x+1)\cdots(x+n-1)=\sum_{k=0}^{n} c(n,k)\,x^{k}\]

More practice problems: stirling number of the first kind

← ZW-STIRLING-NUMBER-OF-THE-FIRST-KIND-002 ZW-STIRLING-NUMBER-OF-THE-FIRST-KIND-004 →