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

What does the number \(c(n,k)\) count?

Choose one option.

Show answer
  • C. Permutations of \(n\) elements with exactly \(k\) cycles

Explanation

Stirling numbers of the first kind count permutations by their number of cycles. The option about partitions into blocks describes a different family.

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 →