Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

surjective function

A function that hits every target at least once, counted by inclusion-exclusion.

A surjective function from an n-set onto an m-set hits every target; there are \sum_{i=0}^m(-1)^i\binom{m}{i}(m-i)^n of them.

Read the full section →
Graph settings

Calculator