Surjection Counter

Σ(-1)^i·C(k,i)·(k-i)^n

All Tools

Loading tool...

About Surjection Counter

A surjection counter computing the number of onto functions from [n] to [k] using inclusion-exclusion: S(n,k) = Σ(-1)^i·C(k,i)·(k-i)^n. Related to Stirling numbers of the second kind: S(n,k) = k!·S₂(n,k). Client-side.

Surjection Counter Features

  • Surjection count
  • Inclusion-exclusion
  • Stirling link
  • Step-by-step
  • Both directions
Advertisement
Advertisement